./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_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_push_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 d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:55:56,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:55:56,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:55:56,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:55:56,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:55:56,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:55:56,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:55:56,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:55:56,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:55:56,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:55:56,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:55:56,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:55:56,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:55:56,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:55:56,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:55:56,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:55:56,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:55:56,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:55:56,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:55:56,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:55:56,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:55:56,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:55:56,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:55:56,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:55:56,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:55:56,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:55:56,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:55:56,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:55:56,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:55:56,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:55:56,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:55:56,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:55:56,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:55:56,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:55:56,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:55:56,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:55:56,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:55:56,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:55:56,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:55:56,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:55:56,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:55:56,771 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:55:56,791 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:55:56,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:55:56,792 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:55:56,792 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:55:56,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:55:56,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:55:56,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:55:56,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:55:56,794 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:55:56,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:55:56,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 00:55:56,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:55:56,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:55:56,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:55:56,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:55:56,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:55:56,795 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:55:56,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:55:56,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:55:56,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:55:56,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:55:56,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:55:56,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:55:56,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:55:56,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:55:56,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 00:55:56,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 00:55:56,797 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:55:56,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:55:56,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:55:56,797 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:55:56,797 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 -> d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 [2021-12-18 00:55:56,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:55:57,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:55:57,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:55:57,022 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:55:57,023 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:55:57,023 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_push_back_harness.i [2021-12-18 00:55:57,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a424d0470/a1fb15b35cef4dbc8428018b8dc16fbb/FLAG851e23380 [2021-12-18 00:55:57,565 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:55:57,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2021-12-18 00:55:57,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a424d0470/a1fb15b35cef4dbc8428018b8dc16fbb/FLAG851e23380 [2021-12-18 00:55:58,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a424d0470/a1fb15b35cef4dbc8428018b8dc16fbb [2021-12-18 00:55:58,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:55:58,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:55:58,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:55:58,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:55:58,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:55:58,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:58" (1/1) ... [2021-12-18 00:55:58,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3d436b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:58, skipping insertion in model container [2021-12-18 00:55:58,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:55:58" (1/1) ... [2021-12-18 00:55:58,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:55:58,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:55:58,377 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_push_back_harness.i[4499,4512] [2021-12-18 00:55:58,383 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_push_back_harness.i[4559,4572] [2021-12-18 00:55:58,742 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,744 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,745 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,747 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,749 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,762 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,780 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,781 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,781 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,783 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,783 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,783 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,784 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:58,939 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:55:58,941 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:55:58,942 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:55:58,943 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:55:58,943 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:55:58,944 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:55:58,944 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:55:58,945 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:55:58,946 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:55:58,950 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:55:59,062 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:55:59,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:55:59,102 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:55:59,121 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_push_back_harness.i[4499,4512] [2021-12-18 00:55:59,122 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_push_back_harness.i[4559,4572] [2021-12-18 00:55:59,172 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,173 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,173 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,174 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,175 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,179 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,183 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,184 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,184 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,185 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,185 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,186 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,186 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:55:59,211 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:55:59,212 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:55:59,213 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:55:59,213 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:55:59,217 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:55:59,217 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:55:59,218 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:55:59,218 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:55:59,218 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:55:59,219 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:55:59,241 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:55:59,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:55:59,372 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:55:59,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59 WrapperNode [2021-12-18 00:55:59,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:55:59,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:55:59,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:55:59,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:55:59,378 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:55:59" (1/1) ... [2021-12-18 00:55:59,457 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:55:59" (1/1) ... [2021-12-18 00:55:59,497 INFO L137 Inliner]: procedures = 679, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 150 [2021-12-18 00:55:59,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:55:59,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:55:59,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:55:59,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:55:59,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:55:59,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:55:59,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:55:59,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:55:59,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (1/1) ... [2021-12-18 00:55:59,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:55:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:55:59,600 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:55:59,639 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:55:59,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 00:55:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:55:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:55:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2021-12-18 00:55:59,666 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2021-12-18 00:55:59,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 00:55:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2021-12-18 00:55:59,667 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2021-12-18 00:55:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:55:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 00:55:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2021-12-18 00:55:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2021-12-18 00:55:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:55:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:55:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:55:59,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:55:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 00:55:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 00:55:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:55:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 00:55:59,669 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 00:55:59,669 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2021-12-18 00:55:59,670 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2021-12-18 00:55:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 00:55:59,876 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:55:59,878 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:56:00,064 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:56:00,070 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:56:00,070 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-18 00:56:00,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:00 BoogieIcfgContainer [2021-12-18 00:56:00,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:56:00,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:56:00,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:56:00,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:56:00,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:55:58" (1/3) ... [2021-12-18 00:56:00,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2be670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:00, skipping insertion in model container [2021-12-18 00:56:00,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:55:59" (2/3) ... [2021-12-18 00:56:00,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2be670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:56:00, skipping insertion in model container [2021-12-18 00:56:00,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:56:00" (3/3) ... [2021-12-18 00:56:00,078 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2021-12-18 00:56:00,081 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:56:00,082 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:56:00,111 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:56:00,123 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:56:00,125 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:56:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-18 00:56:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-18 00:56:00,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:00,150 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:56:00,151 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 524704703, now seen corresponding path program 1 times [2021-12-18 00:56:00,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:00,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163161476] [2021-12-18 00:56:00,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:00,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:56:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:56:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:56:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 00:56:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 00:56:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:56:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:00,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163161476] [2021-12-18 00:56:00,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163161476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:00,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:00,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 00:56:00,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861328083] [2021-12-18 00:56:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:00,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 00:56:00,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 00:56:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 00:56:00,649 INFO L87 Difference]: Start difference. First operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 00:56:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:00,724 INFO L93 Difference]: Finished difference Result 208 states and 310 transitions. [2021-12-18 00:56:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:56:00,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2021-12-18 00:56:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:00,733 INFO L225 Difference]: With dead ends: 208 [2021-12-18 00:56:00,733 INFO L226 Difference]: Without dead ends: 109 [2021-12-18 00:56:00,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:56:00,743 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 21 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:00,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 398 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:56:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-18 00:56:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2021-12-18 00:56:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-12-18 00:56:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2021-12-18 00:56:00,775 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2021-12-18 00:56:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:00,777 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2021-12-18 00:56:00,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 00:56:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2021-12-18 00:56:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-18 00:56:00,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:00,780 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:56:00,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 00:56:00,780 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -125862913, now seen corresponding path program 1 times [2021-12-18 00:56:00,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:00,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163483239] [2021-12-18 00:56:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:00,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:56:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:56:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:56:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 00:56:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 00:56:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:56:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:00,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163483239] [2021-12-18 00:56:00,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163483239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:00,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:00,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 00:56:00,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742063960] [2021-12-18 00:56:00,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:00,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 00:56:00,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:00,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 00:56:00,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 00:56:00,919 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 00:56:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:00,941 INFO L93 Difference]: Finished difference Result 192 states and 265 transitions. [2021-12-18 00:56:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:56:00,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2021-12-18 00:56:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:00,943 INFO L225 Difference]: With dead ends: 192 [2021-12-18 00:56:00,943 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 00:56:00,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:56:00,944 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 12 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:00,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:56:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 00:56:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2021-12-18 00:56:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-12-18 00:56:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2021-12-18 00:56:00,953 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 73 [2021-12-18 00:56:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:00,954 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2021-12-18 00:56:00,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-18 00:56:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2021-12-18 00:56:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-18 00:56:00,955 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:00,955 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:56:00,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 00:56:00,956 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2140518273, now seen corresponding path program 1 times [2021-12-18 00:56:00,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556747616] [2021-12-18 00:56:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:00,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:56:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:56:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:56:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 00:56:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 00:56:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:56:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:01,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:01,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556747616] [2021-12-18 00:56:01,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556747616] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:01,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:01,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 00:56:01,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098171813] [2021-12-18 00:56:01,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:01,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:56:01,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:01,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:56:01,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:56:01,088 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:01,165 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2021-12-18 00:56:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:56:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2021-12-18 00:56:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:01,168 INFO L225 Difference]: With dead ends: 192 [2021-12-18 00:56:01,169 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 00:56:01,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:56:01,173 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 22 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:01,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 571 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:56:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 00:56:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2021-12-18 00:56:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-12-18 00:56:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2021-12-18 00:56:01,183 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 73 [2021-12-18 00:56:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:01,184 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2021-12-18 00:56:01,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2021-12-18 00:56:01,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-18 00:56:01,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:01,187 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:56:01,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 00:56:01,187 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:01,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:01,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2124999555, now seen corresponding path program 1 times [2021-12-18 00:56:01,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:01,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902525089] [2021-12-18 00:56:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:01,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:56:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:56:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:56:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 00:56:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 00:56:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:56:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:01,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:01,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902525089] [2021-12-18 00:56:01,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902525089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:01,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:01,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 00:56:01,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175535539] [2021-12-18 00:56:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:01,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:56:01,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:01,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:56:01,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:56:01,366 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:01,414 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2021-12-18 00:56:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:56:01,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2021-12-18 00:56:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:01,415 INFO L225 Difference]: With dead ends: 201 [2021-12-18 00:56:01,415 INFO L226 Difference]: Without dead ends: 102 [2021-12-18 00:56:01,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:56:01,416 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 28 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:01,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 570 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:56:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-18 00:56:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-18 00:56:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-12-18 00:56:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2021-12-18 00:56:01,423 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 73 [2021-12-18 00:56:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:01,423 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2021-12-18 00:56:01,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2021-12-18 00:56:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-18 00:56:01,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:01,424 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:56:01,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 00:56:01,425 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1956548997, now seen corresponding path program 1 times [2021-12-18 00:56:01,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:01,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340036296] [2021-12-18 00:56:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:01,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-18 00:56:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:56:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:56:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 00:56:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 00:56:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:56:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-18 00:56:01,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:01,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340036296] [2021-12-18 00:56:01,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340036296] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:56:01,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702671791] [2021-12-18 00:56:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:01,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:01,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:56:01,577 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:56:01,604 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:56:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:01,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 00:56:01,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:56:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 00:56:01,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:56:01,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702671791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:01,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:56:01,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 11 [2021-12-18 00:56:01,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235908975] [2021-12-18 00:56:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:01,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:56:01,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:01,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:56:01,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:56:01,953 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-18 00:56:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:02,137 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2021-12-18 00:56:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:56:02,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 73 [2021-12-18 00:56:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:02,139 INFO L225 Difference]: With dead ends: 194 [2021-12-18 00:56:02,139 INFO L226 Difference]: Without dead ends: 106 [2021-12-18 00:56:02,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:56:02,140 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 130 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:02,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 713 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:56:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-18 00:56:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2021-12-18 00:56:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-12-18 00:56:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2021-12-18 00:56:02,146 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 73 [2021-12-18 00:56:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:02,147 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2021-12-18 00:56:02,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-18 00:56:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2021-12-18 00:56:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-18 00:56:02,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:02,148 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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:56:02,181 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:56:02,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:02,366 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1237560575, now seen corresponding path program 1 times [2021-12-18 00:56:02,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349549030] [2021-12-18 00:56:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:02,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-18 00:56:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-18 00:56:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 00:56:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-18 00:56:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:56:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:56:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:02,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:02,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349549030] [2021-12-18 00:56:02,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349549030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:02,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:02,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 00:56:02,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298910940] [2021-12-18 00:56:02,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:02,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 00:56:02,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 00:56:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:56:02,487 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:02,542 INFO L93 Difference]: Finished difference Result 194 states and 262 transitions. [2021-12-18 00:56:02,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 00:56:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2021-12-18 00:56:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:02,543 INFO L225 Difference]: With dead ends: 194 [2021-12-18 00:56:02,544 INFO L226 Difference]: Without dead ends: 104 [2021-12-18 00:56:02,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:56:02,544 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 65 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:02,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 527 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:56:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-18 00:56:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-12-18 00:56:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-12-18 00:56:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2021-12-18 00:56:02,565 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 75 [2021-12-18 00:56:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:02,565 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2021-12-18 00:56:02,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2021-12-18 00:56:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-18 00:56:02,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:02,566 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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:56:02,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 00:56:02,567 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1187141198, now seen corresponding path program 1 times [2021-12-18 00:56:02,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:02,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010386421] [2021-12-18 00:56:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:02,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-18 00:56:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-18 00:56:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-18 00:56:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-18 00:56:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 00:56:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:56:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:02,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:02,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010386421] [2021-12-18 00:56:02,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010386421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:02,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:02,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 00:56:02,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429550772] [2021-12-18 00:56:02,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:02,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:56:02,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:02,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:56:02,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:56:02,678 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:02,716 INFO L93 Difference]: Finished difference Result 199 states and 268 transitions. [2021-12-18 00:56:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:56:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2021-12-18 00:56:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:02,718 INFO L225 Difference]: With dead ends: 199 [2021-12-18 00:56:02,718 INFO L226 Difference]: Without dead ends: 109 [2021-12-18 00:56:02,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:56:02,719 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 26 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:02,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 441 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:56:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-18 00:56:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2021-12-18 00:56:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-12-18 00:56:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2021-12-18 00:56:02,724 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 77 [2021-12-18 00:56:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:02,724 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2021-12-18 00:56:02,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2021-12-18 00:56:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-18 00:56:02,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:02,725 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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:56:02,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 00:56:02,725 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1548809988, now seen corresponding path program 1 times [2021-12-18 00:56:02,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:02,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098029137] [2021-12-18 00:56:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:02,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-18 00:56:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-18 00:56:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 00:56:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:56:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 00:56:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 00:56:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:02,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:02,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098029137] [2021-12-18 00:56:02,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098029137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:02,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:02,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 00:56:02,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446772097] [2021-12-18 00:56:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:02,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:56:02,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:56:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:56:02,819 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:02,857 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2021-12-18 00:56:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:56:02,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2021-12-18 00:56:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:02,858 INFO L225 Difference]: With dead ends: 202 [2021-12-18 00:56:02,859 INFO L226 Difference]: Without dead ends: 111 [2021-12-18 00:56:02,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:56:02,859 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 23 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:02,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 449 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 00:56:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-18 00:56:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2021-12-18 00:56:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-12-18 00:56:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2021-12-18 00:56:02,865 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 78 [2021-12-18 00:56:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:02,865 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2021-12-18 00:56:02,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-18 00:56:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2021-12-18 00:56:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-18 00:56:02,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:02,866 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-18 00:56:02,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 00:56:02,866 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1185344546, now seen corresponding path program 1 times [2021-12-18 00:56:02,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:02,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40049000] [2021-12-18 00:56:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:02,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:56:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-18 00:56:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-18 00:56:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:56:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 00:56:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 00:56:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-18 00:56:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-18 00:56:03,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40049000] [2021-12-18 00:56:03,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40049000] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:56:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682430163] [2021-12-18 00:56:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:03,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:03,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:56:03,004 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:56:03,046 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:56:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 00:56:03,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:56:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-18 00:56:03,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:56:03,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682430163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:03,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:56:03,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 12 [2021-12-18 00:56:03,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440679457] [2021-12-18 00:56:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:03,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 00:56:03,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 00:56:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:56:03,438 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:03,639 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2021-12-18 00:56:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:56:03,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 86 [2021-12-18 00:56:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:03,641 INFO L225 Difference]: With dead ends: 203 [2021-12-18 00:56:03,641 INFO L226 Difference]: Without dead ends: 111 [2021-12-18 00:56:03,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-12-18 00:56:03,642 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 132 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:03,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 709 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:56:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-18 00:56:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2021-12-18 00:56:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-12-18 00:56:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2021-12-18 00:56:03,647 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 86 [2021-12-18 00:56:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:03,648 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2021-12-18 00:56:03,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2021-12-18 00:56:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-18 00:56:03,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:03,649 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:56:03,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-18 00:56:03,854 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,SelfDestructingSolverStorable8 [2021-12-18 00:56:03,854 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 172862485, now seen corresponding path program 1 times [2021-12-18 00:56:03,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:03,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444063348] [2021-12-18 00:56:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:03,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:56:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 00:56:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 00:56:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 00:56:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-18 00:56:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:04,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 00:56:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:04,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-18 00:56:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:04,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:04,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444063348] [2021-12-18 00:56:04,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444063348] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:56:04,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233479216] [2021-12-18 00:56:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:04,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:04,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:56:04,014 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:56:04,015 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:56:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:04,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 00:56:04,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:56:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-18 00:56:04,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:56:04,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233479216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:04,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:56:04,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2021-12-18 00:56:04,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270599391] [2021-12-18 00:56:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:04,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:56:04,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:04,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:56:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-12-18 00:56:04,462 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:04,658 INFO L93 Difference]: Finished difference Result 208 states and 274 transitions. [2021-12-18 00:56:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:56:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 88 [2021-12-18 00:56:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:04,659 INFO L225 Difference]: With dead ends: 208 [2021-12-18 00:56:04,660 INFO L226 Difference]: Without dead ends: 115 [2021-12-18 00:56:04,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-12-18 00:56:04,661 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 136 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:04,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 889 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:56:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-18 00:56:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2021-12-18 00:56:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2021-12-18 00:56:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2021-12-18 00:56:04,673 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 88 [2021-12-18 00:56:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:04,674 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2021-12-18 00:56:04,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2021-12-18 00:56:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-18 00:56:04,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:04,675 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-18 00:56:04,694 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:56:04,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:04,887 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 759251201, now seen corresponding path program 1 times [2021-12-18 00:56:04,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:04,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141432033] [2021-12-18 00:56:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:04,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:56:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:56:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:56:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:56:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:56:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:56:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:56:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-18 00:56:05,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141432033] [2021-12-18 00:56:05,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141432033] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:05,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:05,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-18 00:56:05,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234914353] [2021-12-18 00:56:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:05,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 00:56:05,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 00:56:05,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:56:05,353 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:05,864 INFO L93 Difference]: Finished difference Result 164 states and 230 transitions. [2021-12-18 00:56:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 00:56:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2021-12-18 00:56:05,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:05,866 INFO L225 Difference]: With dead ends: 164 [2021-12-18 00:56:05,866 INFO L226 Difference]: Without dead ends: 162 [2021-12-18 00:56:05,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-12-18 00:56:05,867 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 56 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:05,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1384 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 00:56:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-18 00:56:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2021-12-18 00:56:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 43 states have call successors, (43), 9 states have call predecessors, (43), 11 states have return successors, (51), 41 states have call predecessors, (51), 42 states have call successors, (51) [2021-12-18 00:56:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 196 transitions. [2021-12-18 00:56:05,875 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 196 transitions. Word has length 89 [2021-12-18 00:56:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:05,875 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 196 transitions. [2021-12-18 00:56:05,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2021-12-18 00:56:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-18 00:56:05,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:05,876 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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:56:05,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 00:56:05,877 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash -50095425, now seen corresponding path program 1 times [2021-12-18 00:56:05,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:05,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064525477] [2021-12-18 00:56:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:05,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:56:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:56:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:56:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:56:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:56:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:56:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:56:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-18 00:56:06,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:06,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064525477] [2021-12-18 00:56:06,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064525477] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:06,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:06,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 00:56:06,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051485785] [2021-12-18 00:56:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:06,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 00:56:06,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 00:56:06,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:56:06,147 INFO L87 Difference]: Start difference. First operand 143 states and 196 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:06,399 INFO L93 Difference]: Finished difference Result 243 states and 336 transitions. [2021-12-18 00:56:06,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:56:06,399 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2021-12-18 00:56:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:06,400 INFO L225 Difference]: With dead ends: 243 [2021-12-18 00:56:06,400 INFO L226 Difference]: Without dead ends: 149 [2021-12-18 00:56:06,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:56:06,401 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 58 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:06,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 951 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:56:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-18 00:56:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-12-18 00:56:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (56), 41 states have call predecessors, (56), 42 states have call successors, (56) [2021-12-18 00:56:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 206 transitions. [2021-12-18 00:56:06,409 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 206 transitions. Word has length 89 [2021-12-18 00:56:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:06,409 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 206 transitions. [2021-12-18 00:56:06,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 206 transitions. [2021-12-18 00:56:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-18 00:56:06,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:06,410 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:56:06,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 00:56:06,410 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash -443122435, now seen corresponding path program 1 times [2021-12-18 00:56:06,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880685510] [2021-12-18 00:56:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:06,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:56:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:56:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:56:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:56:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:56:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:56:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:56:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:56:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-18 00:56:06,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:06,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880685510] [2021-12-18 00:56:06,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880685510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:56:06,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:56:06,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 00:56:06,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183038867] [2021-12-18 00:56:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:56:06,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 00:56:06,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:06,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 00:56:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:56:06,632 INFO L87 Difference]: Start difference. First operand 148 states and 206 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:06,863 INFO L93 Difference]: Finished difference Result 287 states and 397 transitions. [2021-12-18 00:56:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 00:56:06,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2021-12-18 00:56:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:06,864 INFO L225 Difference]: With dead ends: 287 [2021-12-18 00:56:06,864 INFO L226 Difference]: Without dead ends: 169 [2021-12-18 00:56:06,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:56:06,865 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 86 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:06,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 1063 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:56:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-18 00:56:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2021-12-18 00:56:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 108 states have (on average 1.1759259259259258) internal successors, (127), 114 states have internal predecessors, (127), 42 states have call successors, (42), 10 states have call predecessors, (42), 14 states have return successors, (53), 40 states have call predecessors, (53), 41 states have call successors, (53) [2021-12-18 00:56:06,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2021-12-18 00:56:06,874 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 89 [2021-12-18 00:56:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:06,875 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2021-12-18 00:56:06,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-18 00:56:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2021-12-18 00:56:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-18 00:56:06,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:06,876 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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:56:06,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 00:56:06,876 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1974343619, now seen corresponding path program 1 times [2021-12-18 00:56:06,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:06,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436574011] [2021-12-18 00:56:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:06,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:56:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:56:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-18 00:56:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-18 00:56:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-18 00:56:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 00:56:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 00:56:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-18 00:56:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:07,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:07,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436574011] [2021-12-18 00:56:07,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436574011] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:56:07,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108759073] [2021-12-18 00:56:07,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:07,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:07,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:56:07,184 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:56:07,185 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:56:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:07,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-18 00:56:07,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:56:07,602 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 00:56:07,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:56:07,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 00:56:07,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:56:07,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:56:07,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2021-12-18 00:56:07,683 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 14 treesize of output 18 [2021-12-18 00:56:08,049 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-18 00:56:08,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 1 [2021-12-18 00:56:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-18 00:56:08,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:56:08,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3776 Int) (v_ArrVal_3777 (Array Int Int)) (v_ArrVal_3778 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 16) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_3777) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_3778) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_3776)) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)))) is different from false [2021-12-18 00:56:08,491 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:56:08,491 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2021-12-18 00:56:08,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:56:08,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 149 [2021-12-18 00:56:08,506 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 148 treesize of output 144 [2021-12-18 00:56:08,513 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 144 treesize of output 142 [2021-12-18 00:56:08,631 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 6 treesize of output 4 [2021-12-18 00:56:08,678 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 6 treesize of output 4 [2021-12-18 00:56:08,682 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 6 treesize of output 4 [2021-12-18 00:56:08,696 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:56:08,696 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 50 treesize of output 52 [2021-12-18 00:56:08,739 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 6 treesize of output 4 [2021-12-18 00:56:08,752 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:56:08,752 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 27 treesize of output 31 [2021-12-18 00:56:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 1 not checked. [2021-12-18 00:56:08,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108759073] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:56:08,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:56:08,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 32 [2021-12-18 00:56:08,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438427811] [2021-12-18 00:56:08,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:56:08,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 00:56:08,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 00:56:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=825, Unknown=1, NotChecked=58, Total=992 [2021-12-18 00:56:08,866 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand has 32 states, 29 states have (on average 4.0) internal successors, (116), 32 states have internal predecessors, (116), 9 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2021-12-18 00:56:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:56:09,611 INFO L93 Difference]: Finished difference Result 390 states and 544 transitions. [2021-12-18 00:56:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 00:56:09,612 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 4.0) internal successors, (116), 32 states have internal predecessors, (116), 9 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) Word has length 91 [2021-12-18 00:56:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:56:09,614 INFO L225 Difference]: With dead ends: 390 [2021-12-18 00:56:09,614 INFO L226 Difference]: Without dead ends: 252 [2021-12-18 00:56:09,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=1518, Unknown=1, NotChecked=80, Total=1806 [2021-12-18 00:56:09,615 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 164 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:56:09,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 2665 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 751 Invalid, 0 Unknown, 251 Unchecked, 0.5s Time] [2021-12-18 00:56:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-18 00:56:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 201. [2021-12-18 00:56:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 146 states have internal predecessors, (162), 45 states have call successors, (45), 12 states have call predecessors, (45), 16 states have return successors, (56), 42 states have call predecessors, (56), 44 states have call successors, (56) [2021-12-18 00:56:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 263 transitions. [2021-12-18 00:56:09,633 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 263 transitions. Word has length 91 [2021-12-18 00:56:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:56:09,633 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 263 transitions. [2021-12-18 00:56:09,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 4.0) internal successors, (116), 32 states have internal predecessors, (116), 9 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2021-12-18 00:56:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2021-12-18 00:56:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-18 00:56:09,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:56:09,634 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2021-12-18 00:56:09,669 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:56:09,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:09,835 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:56:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:56:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1447052805, now seen corresponding path program 2 times [2021-12-18 00:56:09,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:56:09,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901455647] [2021-12-18 00:56:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:56:09,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:56:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:56:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:56:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-18 00:56:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:56:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-18 00:56:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:56:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:56:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-18 00:56:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-12-18 00:56:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-18 00:56:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:56:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 00:56:10,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:56:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901455647] [2021-12-18 00:56:10,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901455647] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:56:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880445350] [2021-12-18 00:56:10,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 00:56:10,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:56:10,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:56:10,130 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:56:10,132 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:56:10,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 00:56:10,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:56:10,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-18 00:56:10,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:56:10,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:56:10,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:56:10,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-18 00:56:10,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:56:10,635 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 9 treesize of output 11 [2021-12-18 00:56:10,638 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:56:12,674 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_3| Int)) (< (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_3|) 24) 1) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_3|)) is different from true [2021-12-18 00:56:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-18 00:56:35,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:56:41,435 INFO L354 Elim1Store]: treesize reduction 8, result has 95.2 percent of original size [2021-12-18 00:56:41,435 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 1793 treesize of output 1819 [2021-12-18 00:56:41,475 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 7817 treesize of output 7489 [2021-12-18 00:56:41,509 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 7489 treesize of output 7325 [2021-12-18 00:56:41,546 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 7325 treesize of output 6997 [2021-12-18 00:56:41,625 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:56:41,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7051 treesize of output 6761 [2021-12-18 00:56:41,732 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:56:41,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8714 treesize of output 8326 [2021-12-18 00:56:45,702 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-18 00:56:46,255 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 132 treesize of output 128 [2021-12-18 00:56:46,342 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 132 treesize of output 128 [2021-12-18 00:56:46,416 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 137 treesize of output 131 [2021-12-18 00:56:46,464 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 132 treesize of output 128 [2021-12-18 00:56:46,596 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 00:56:46,597 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 147 treesize of output 139 [2021-12-18 00:56:46,748 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 139 treesize of output 135 [2021-12-18 00:56:47,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:56:47,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2021-12-18 00:56:47,816 WARN L234 Elim1Store]: Array PQE input equivalent to true [2021-12-18 00:56:48,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:56:48,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2021-12-18 00:56:49,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:56:49,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2021-12-18 00:56:49,967 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 00:56:49,967 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 80 treesize of output 74 [2021-12-18 00:56:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-18 00:56:50,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880445350] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 00:56:50,169 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 00:56:50,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 18] total 42 [2021-12-18 00:56:50,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803722381] [2021-12-18 00:56:50,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 00:56:50,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-18 00:56:50,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:56:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-18 00:56:50,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1506, Unknown=5, NotChecked=78, Total=1722 [2021-12-18 00:56:50,184 INFO L87 Difference]: Start difference. First operand 201 states and 263 transitions. Second operand has 42 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 37 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2021-12-18 00:57:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:57:50,132 INFO L93 Difference]: Finished difference Result 421 states and 589 transitions. [2021-12-18 00:57:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-18 00:57:50,133 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 37 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) Word has length 93 [2021-12-18 00:57:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:57:50,135 INFO L225 Difference]: With dead ends: 421 [2021-12-18 00:57:50,135 INFO L226 Difference]: Without dead ends: 290 [2021-12-18 00:57:50,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 88.4s TimeCoverageRelationStatistics Valid=308, Invalid=3088, Unknown=30, NotChecked=114, Total=3540 [2021-12-18 00:57:50,136 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 184 mSDsluCounter, 3713 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 3876 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:57:50,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 3876 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1866 Invalid, 0 Unknown, 672 Unchecked, 1.2s Time] [2021-12-18 00:57:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-18 00:57:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 240. [2021-12-18 00:57:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 179 states have internal predecessors, (208), 49 states have call successors, (49), 14 states have call predecessors, (49), 18 states have return successors, (63), 46 states have call predecessors, (63), 48 states have call successors, (63) [2021-12-18 00:57:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 320 transitions. [2021-12-18 00:57:50,150 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 320 transitions. Word has length 93 [2021-12-18 00:57:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:57:50,150 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 320 transitions. [2021-12-18 00:57:50,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 37 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2021-12-18 00:57:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 320 transitions. [2021-12-18 00:57:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-18 00:57:50,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:57:50,151 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:57:50,174 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:57:50,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 00:57:50,368 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:57:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:57:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -270009515, now seen corresponding path program 1 times [2021-12-18 00:57:50,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:57:50,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710586217] [2021-12-18 00:57:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:57:50,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:57:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:57:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:57:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:57:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:57:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:57:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:57:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:57:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:57:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:57:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:57:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:57:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:50,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:57:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-18 00:57:51,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:57:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710586217] [2021-12-18 00:57:51,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710586217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:57:51,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:57:51,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-18 00:57:51,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524259699] [2021-12-18 00:57:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:57:51,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 00:57:51,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:57:51,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 00:57:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-12-18 00:57:51,027 INFO L87 Difference]: Start difference. First operand 240 states and 320 transitions. Second operand has 17 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2021-12-18 00:57:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:57:51,724 INFO L93 Difference]: Finished difference Result 269 states and 370 transitions. [2021-12-18 00:57:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 00:57:51,725 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 103 [2021-12-18 00:57:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:57:51,726 INFO L225 Difference]: With dead ends: 269 [2021-12-18 00:57:51,726 INFO L226 Difference]: Without dead ends: 267 [2021-12-18 00:57:51,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2021-12-18 00:57:51,727 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 47 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:57:51,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1713 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 00:57:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-12-18 00:57:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 248. [2021-12-18 00:57:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 177 states have (on average 1.2033898305084745) internal successors, (213), 185 states have internal predecessors, (213), 50 states have call successors, (50), 15 states have call predecessors, (50), 20 states have return successors, (67), 47 states have call predecessors, (67), 49 states have call successors, (67) [2021-12-18 00:57:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2021-12-18 00:57:51,739 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 103 [2021-12-18 00:57:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:57:51,739 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2021-12-18 00:57:51,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2021-12-18 00:57:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2021-12-18 00:57:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-18 00:57:51,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:57:51,741 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:57:51,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 00:57:51,741 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:57:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:57:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1079356141, now seen corresponding path program 1 times [2021-12-18 00:57:51,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:57:51,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279306589] [2021-12-18 00:57:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:57:51,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:57:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:57:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:57:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:57:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:57:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:57:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:57:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:57:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:57:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:57:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:57:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:57:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:57:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-18 00:57:52,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:57:52,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279306589] [2021-12-18 00:57:52,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279306589] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:57:52,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:57:52,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-18 00:57:52,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666162296] [2021-12-18 00:57:52,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:57:52,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 00:57:52,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:57:52,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 00:57:52,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-12-18 00:57:52,206 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2021-12-18 00:57:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:57:52,909 INFO L93 Difference]: Finished difference Result 408 states and 556 transitions. [2021-12-18 00:57:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 00:57:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 103 [2021-12-18 00:57:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:57:52,911 INFO L225 Difference]: With dead ends: 408 [2021-12-18 00:57:52,911 INFO L226 Difference]: Without dead ends: 266 [2021-12-18 00:57:52,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-12-18 00:57:52,912 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 83 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:57:52,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1533 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 00:57:52,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-18 00:57:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2021-12-18 00:57:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 177 states have (on average 1.2033898305084745) internal successors, (213), 185 states have internal predecessors, (213), 50 states have call successors, (50), 15 states have call predecessors, (50), 20 states have return successors, (65), 47 states have call predecessors, (65), 49 states have call successors, (65) [2021-12-18 00:57:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 328 transitions. [2021-12-18 00:57:52,926 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 328 transitions. Word has length 103 [2021-12-18 00:57:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:57:52,927 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 328 transitions. [2021-12-18 00:57:52,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2021-12-18 00:57:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 328 transitions. [2021-12-18 00:57:52,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-18 00:57:52,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:57:52,931 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:57:52,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 00:57:52,932 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:57:52,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:57:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1472383151, now seen corresponding path program 1 times [2021-12-18 00:57:52,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:57:52,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149659121] [2021-12-18 00:57:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:57:52,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:57:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:57:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:57:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:57:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:57:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:57:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:57:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:57:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:57:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:57:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:57:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:57:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:57:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-18 00:57:53,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:57:53,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149659121] [2021-12-18 00:57:53,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149659121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:57:53,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:57:53,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 00:57:53,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867716618] [2021-12-18 00:57:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:57:53,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 00:57:53,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:57:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 00:57:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:57:53,106 INFO L87 Difference]: Start difference. First operand 248 states and 328 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:57:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:57:53,222 INFO L93 Difference]: Finished difference Result 382 states and 506 transitions. [2021-12-18 00:57:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 00:57:53,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2021-12-18 00:57:53,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:57:53,224 INFO L225 Difference]: With dead ends: 382 [2021-12-18 00:57:53,224 INFO L226 Difference]: Without dead ends: 239 [2021-12-18 00:57:53,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 00:57:53,225 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:57:53,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 785 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:57:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-18 00:57:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-12-18 00:57:53,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 171 states have (on average 1.1988304093567252) internal successors, (205), 177 states have internal predecessors, (205), 49 states have call successors, (49), 15 states have call predecessors, (49), 18 states have return successors, (58), 46 states have call predecessors, (58), 48 states have call successors, (58) [2021-12-18 00:57:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 312 transitions. [2021-12-18 00:57:53,238 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 312 transitions. Word has length 103 [2021-12-18 00:57:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:57:53,238 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 312 transitions. [2021-12-18 00:57:53,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-18 00:57:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 312 transitions. [2021-12-18 00:57:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-18 00:57:53,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:57:53,240 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:57:53,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 00:57:53,240 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:57:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:57:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2046460642, now seen corresponding path program 3 times [2021-12-18 00:57:53,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:57:53,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811894523] [2021-12-18 00:57:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:57:53,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:57:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:57:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:57:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:57:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:57:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:57:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:57:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:57:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 00:57:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:57:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 00:57:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 00:57:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:57:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-18 00:57:53,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:57:53,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811894523] [2021-12-18 00:57:53,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811894523] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:57:53,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497435690] [2021-12-18 00:57:53,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 00:57:53,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:57:53,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:57:53,667 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:57:53,668 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:57:54,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-18 00:57:54,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 00:57:54,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 157 conjunts are in the unsatisfiable core [2021-12-18 00:57:54,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:57:54,331 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 00:57:54,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-18 00:57:54,528 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 00:57:54,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 00:57:54,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:57:54,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-18 00:57:54,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, 1 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:57:56,661 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_5| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_5|) 24) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_5|))) is different from true [2021-12-18 00:57:58,773 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_6| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_6|) 24) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_6|))) is different from true [2021-12-18 00:58:00,834 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_7|) 24) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_7|))) is different from true [2021-12-18 00:58:02,948 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1) 24) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_1))) is different from true [2021-12-18 00:58:09,101 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2) 24) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_2))) is different from true [2021-12-18 00:58:11,163 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3) 24) v_aws_linked_list_insert_before_~before.base_BEFORE_CALL_3))) is different from true [2021-12-18 00:58:11,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:11,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 161 [2021-12-18 00:58:11,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:11,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2021-12-18 00:58:11,276 INFO L354 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2021-12-18 00:58:11,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 121 [2021-12-18 00:58:11,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:11,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 61 [2021-12-18 00:58:11,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:11,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:11,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2021-12-18 00:58:11,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2021-12-18 00:58:11,302 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 16 treesize of output 15 [2021-12-18 00:58:11,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-12-18 00:58:11,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:11,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2021-12-18 00:58:11,330 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:58:11,782 INFO L354 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2021-12-18 00:58:11,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 94 [2021-12-18 00:58:11,795 INFO L354 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2021-12-18 00:58:11,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 35 [2021-12-18 00:58:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 44 not checked. [2021-12-18 00:58:11,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:58:12,198 INFO L354 Elim1Store]: treesize reduction 165, result has 35.3 percent of original size [2021-12-18 00:58:12,199 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 6 case distinctions, treesize of input 168 treesize of output 193 [2021-12-18 00:58:12,211 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:58:12,211 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 431 treesize of output 421 [2021-12-18 00:58:12,225 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:58:12,226 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 450 treesize of output 438 [2021-12-18 00:58:12,233 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 826 treesize of output 810 [2021-12-18 00:58:12,249 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 722 treesize of output 714 [2021-12-18 00:58:12,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:12,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2021-12-18 00:58:12,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:12,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2021-12-18 00:58:12,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:12,382 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 00:58:12,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 65 [2021-12-18 00:58:12,611 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 12 treesize of output 8 [2021-12-18 00:58:12,636 INFO L354 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2021-12-18 00:58:12,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2021-12-18 00:58:12,659 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= c_aws_linked_list_insert_before_~to_add.base c_aws_linked_list_insert_before_~before.base))) (or (and (forall ((v_ArrVal_5415 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_5415) c_aws_linked_list_insert_before_~before.base) (+ c_aws_linked_list_insert_before_~before.offset 8))))) (not .cse0)) (and (forall ((v_ArrVal_5393 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_5393) c_aws_linked_list_insert_before_~before.base) (+ c_aws_linked_list_insert_before_~before.offset 8))))) .cse0))) (or (not (= c_aws_linked_list_insert_before_~before.base c_aws_linked_list_insert_before_~to_add.base)) (not (= (+ c_aws_linked_list_insert_before_~before.offset 8) c_aws_linked_list_insert_before_~to_add.offset))) (forall ((v_ArrVal_5389 (Array Int Int)) (v_ArrVal_5388 (Array Int Int)) (v_ArrVal_5404 (Array Int Int)) (v_ArrVal_5379 Int) (v_ArrVal_5403 (Array Int Int)) (v_ArrVal_5409 (Array Int Int))) (= (select (select (let ((.cse1 (+ c_aws_linked_list_insert_before_~before.offset 8))) (store (store (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base (store (store (select |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base) c_aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base) (+ c_aws_linked_list_insert_before_~to_add.offset 8) v_ArrVal_5379)) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_5388) c_aws_linked_list_insert_before_~before.base) .cse1) v_ArrVal_5403) c_aws_linked_list_insert_before_~before.base (store (select (store (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_5409) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_5389) c_aws_linked_list_insert_before_~before.base) .cse1) v_ArrVal_5404) c_aws_linked_list_insert_before_~before.base) .cse1 c_aws_linked_list_insert_before_~to_add.base))) c_aws_linked_list_insert_before_~to_add.base) c_aws_linked_list_insert_before_~to_add.offset) c_aws_linked_list_insert_before_~before.base))) is different from false [2021-12-18 00:58:12,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497435690] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:58:12,681 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:58:12,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 35 [2021-12-18 00:58:12,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057527218] [2021-12-18 00:58:12,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 00:58:12,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-18 00:58:12,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:58:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-18 00:58:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1036, Unknown=8, NotChecked=490, Total=1640 [2021-12-18 00:58:12,683 INFO L87 Difference]: Start difference. First operand 239 states and 312 transitions. Second operand has 35 states, 32 states have (on average 3.8125) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (23), 12 states have call predecessors, (23), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2021-12-18 00:58:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:58:21,644 INFO L93 Difference]: Finished difference Result 369 states and 481 transitions. [2021-12-18 00:58:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-18 00:58:21,645 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 3.8125) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (23), 12 states have call predecessors, (23), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) Word has length 102 [2021-12-18 00:58:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:58:21,646 INFO L225 Difference]: With dead ends: 369 [2021-12-18 00:58:21,646 INFO L226 Difference]: Without dead ends: 364 [2021-12-18 00:58:21,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 103 SyntacticMatches, 13 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=198, Invalid=1890, Unknown=10, NotChecked=658, Total=2756 [2021-12-18 00:58:21,648 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 63 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2305 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 00:58:21,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 2353 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 826 Invalid, 0 Unknown, 2305 Unchecked, 0.6s Time] [2021-12-18 00:58:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-12-18 00:58:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 342. [2021-12-18 00:58:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 244 states have (on average 1.1844262295081966) internal successors, (289), 253 states have internal predecessors, (289), 64 states have call successors, (64), 25 states have call predecessors, (64), 33 states have return successors, (82), 63 states have call predecessors, (82), 63 states have call successors, (82) [2021-12-18 00:58:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 435 transitions. [2021-12-18 00:58:21,698 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 435 transitions. Word has length 102 [2021-12-18 00:58:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:58:21,698 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 435 transitions. [2021-12-18 00:58:21,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 3.8125) internal successors, (122), 30 states have internal predecessors, (122), 11 states have call successors, (23), 12 states have call predecessors, (23), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2021-12-18 00:58:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 435 transitions. [2021-12-18 00:58:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-18 00:58:21,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:58:21,700 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:58:21,720 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:58:21,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:58:21,920 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:58:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:58:21,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1303128156, now seen corresponding path program 1 times [2021-12-18 00:58:21,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:58:21,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499768182] [2021-12-18 00:58:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:58:21,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:58:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:58:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:58:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:58:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:58:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:58:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:58:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:58:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:58:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:58:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:58:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:58:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:58:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:58:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:58:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-18 00:58:22,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:58:22,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499768182] [2021-12-18 00:58:22,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499768182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:58:22,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:58:22,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-18 00:58:22,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415892730] [2021-12-18 00:58:22,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:58:22,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 00:58:22,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:58:22,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 00:58:22,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:58:22,466 INFO L87 Difference]: Start difference. First operand 342 states and 435 transitions. Second operand has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-18 00:58:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:58:23,062 INFO L93 Difference]: Finished difference Result 377 states and 498 transitions. [2021-12-18 00:58:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 00:58:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 117 [2021-12-18 00:58:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:58:23,064 INFO L225 Difference]: With dead ends: 377 [2021-12-18 00:58:23,064 INFO L226 Difference]: Without dead ends: 375 [2021-12-18 00:58:23,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-12-18 00:58:23,067 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 45 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:58:23,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 2085 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 00:58:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-12-18 00:58:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 350. [2021-12-18 00:58:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 249 states have (on average 1.180722891566265) internal successors, (294), 259 states have internal predecessors, (294), 65 states have call successors, (65), 26 states have call predecessors, (65), 35 states have return successors, (94), 64 states have call predecessors, (94), 64 states have call successors, (94) [2021-12-18 00:58:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 453 transitions. [2021-12-18 00:58:23,091 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 453 transitions. Word has length 117 [2021-12-18 00:58:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:58:23,093 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 453 transitions. [2021-12-18 00:58:23,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-18 00:58:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 453 transitions. [2021-12-18 00:58:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-18 00:58:23,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:58:23,098 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:58:23,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 00:58:23,098 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:58:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:58:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2112474782, now seen corresponding path program 1 times [2021-12-18 00:58:23,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:58:23,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839948332] [2021-12-18 00:58:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:58:23,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:58:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:58:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:58:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:58:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:58:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:58:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:58:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:58:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:58:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:58:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:58:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:58:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:58:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:58:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:58:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-18 00:58:23,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:58:23,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839948332] [2021-12-18 00:58:23,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839948332] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:58:23,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:58:23,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-18 00:58:23,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503517938] [2021-12-18 00:58:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:58:23,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-18 00:58:23,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:58:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-18 00:58:23,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-12-18 00:58:23,536 INFO L87 Difference]: Start difference. First operand 350 states and 453 transitions. Second operand has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 9 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2021-12-18 00:58:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:58:24,211 INFO L93 Difference]: Finished difference Result 490 states and 650 transitions. [2021-12-18 00:58:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 00:58:24,211 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 9 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 117 [2021-12-18 00:58:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:58:24,213 INFO L225 Difference]: With dead ends: 490 [2021-12-18 00:58:24,213 INFO L226 Difference]: Without dead ends: 365 [2021-12-18 00:58:24,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2021-12-18 00:58:24,214 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 116 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 00:58:24,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 1371 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-18 00:58:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-18 00:58:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 355. [2021-12-18 00:58:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 253 states have (on average 1.1818181818181819) internal successors, (299), 264 states have internal predecessors, (299), 65 states have call successors, (65), 26 states have call predecessors, (65), 36 states have return successors, (102), 64 states have call predecessors, (102), 64 states have call successors, (102) [2021-12-18 00:58:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 466 transitions. [2021-12-18 00:58:24,243 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 466 transitions. Word has length 117 [2021-12-18 00:58:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:58:24,243 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 466 transitions. [2021-12-18 00:58:24,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.823529411764706) internal successors, (65), 18 states have internal predecessors, (65), 9 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2021-12-18 00:58:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 466 transitions. [2021-12-18 00:58:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-18 00:58:24,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:58:24,244 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:58:24,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-18 00:58:24,245 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:58:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:58:24,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1789465504, now seen corresponding path program 1 times [2021-12-18 00:58:24,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:58:24,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216388046] [2021-12-18 00:58:24,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:58:24,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:58:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:58:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:58:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:58:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:58:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:58:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:58:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:58:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:58:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:58:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:58:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:58:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:58:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:58:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:58:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-18 00:58:24,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:58:24,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216388046] [2021-12-18 00:58:24,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216388046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:58:24,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:58:24,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 00:58:24,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216942954] [2021-12-18 00:58:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:58:24,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 00:58:24,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:58:24,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 00:58:24,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-18 00:58:24,487 INFO L87 Difference]: Start difference. First operand 355 states and 466 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-18 00:58:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:58:24,635 INFO L93 Difference]: Finished difference Result 498 states and 667 transitions. [2021-12-18 00:58:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 00:58:24,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 117 [2021-12-18 00:58:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:58:24,637 INFO L225 Difference]: With dead ends: 498 [2021-12-18 00:58:24,637 INFO L226 Difference]: Without dead ends: 363 [2021-12-18 00:58:24,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-12-18 00:58:24,638 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:58:24,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 1080 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:58:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-12-18 00:58:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 351. [2021-12-18 00:58:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 251 states have (on average 1.1832669322709164) internal successors, (297), 261 states have internal predecessors, (297), 64 states have call successors, (64), 26 states have call predecessors, (64), 35 states have return successors, (88), 63 states have call predecessors, (88), 63 states have call successors, (88) [2021-12-18 00:58:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 449 transitions. [2021-12-18 00:58:24,654 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 449 transitions. Word has length 117 [2021-12-18 00:58:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:58:24,654 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 449 transitions. [2021-12-18 00:58:24,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2021-12-18 00:58:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 449 transitions. [2021-12-18 00:58:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-18 00:58:24,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:58:24,656 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:58:24,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-18 00:58:24,656 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:58:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:58:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1263280266, now seen corresponding path program 1 times [2021-12-18 00:58:24,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:58:24,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36629511] [2021-12-18 00:58:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:58:24,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:58:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:58:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:58:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:58:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:58:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:58:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:58:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:58:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 00:58:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:58:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 00:58:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 00:58:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-18 00:58:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:58:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-18 00:58:25,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:58:25,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36629511] [2021-12-18 00:58:25,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36629511] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:58:25,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522238526] [2021-12-18 00:58:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:58:25,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:58:25,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:58:25,718 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:58:25,719 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:58:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:26,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 206 conjunts are in the unsatisfiable core [2021-12-18 00:58:26,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:58:26,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 00:58:26,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:26,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:26,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-18 00:58:26,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:26,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:26,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2021-12-18 00:58:26,388 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:58:26,390 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:58:27,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,817 INFO L354 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2021-12-18 00:58:27,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 632 treesize of output 538 [2021-12-18 00:58:27,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:27,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 223 [2021-12-18 00:58:27,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,839 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 19 treesize of output 23 [2021-12-18 00:58:27,879 INFO L354 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2021-12-18 00:58:27,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 190 [2021-12-18 00:58:27,899 INFO L354 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2021-12-18 00:58:27,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 211 treesize of output 200 [2021-12-18 00:58:27,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:27,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 116 [2021-12-18 00:58:27,913 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 29 treesize of output 33 [2021-12-18 00:58:27,919 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 21 treesize of output 17 [2021-12-18 00:58:27,926 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:58:27,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2021-12-18 00:58:27,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:27,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2021-12-18 00:58:27,981 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-18 00:58:27,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 65 [2021-12-18 00:58:27,986 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:58:27,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 00:58:29,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:29,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:29,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:29,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:29,555 INFO L354 Elim1Store]: treesize reduction 8, result has 77.8 percent of original size [2021-12-18 00:58:29,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 258 treesize of output 152 [2021-12-18 00:58:29,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:29,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:29,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:29,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:29,602 INFO L354 Elim1Store]: treesize reduction 189, result has 6.0 percent of original size [2021-12-18 00:58:29,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 22 case distinctions, treesize of input 109 treesize of output 68 [2021-12-18 00:58:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-18 00:58:29,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:58:38,908 WARN L227 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-18 00:58:38,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522238526] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:58:38,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:58:38,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 48 [2021-12-18 00:58:38,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13792517] [2021-12-18 00:58:38,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 00:58:38,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-18 00:58:38,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:58:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-18 00:58:38,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2923, Unknown=1, NotChecked=0, Total=3080 [2021-12-18 00:58:38,959 INFO L87 Difference]: Start difference. First operand 351 states and 449 transitions. Second operand has 48 states, 43 states have (on average 3.0697674418604652) internal successors, (132), 42 states have internal predecessors, (132), 16 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2021-12-18 00:58:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:58:51,628 INFO L93 Difference]: Finished difference Result 484 states and 637 transitions. [2021-12-18 00:58:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-12-18 00:58:51,629 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 3.0697674418604652) internal successors, (132), 42 states have internal predecessors, (132), 16 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) Word has length 116 [2021-12-18 00:58:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:58:51,631 INFO L225 Difference]: With dead ends: 484 [2021-12-18 00:58:51,631 INFO L226 Difference]: Without dead ends: 475 [2021-12-18 00:58:51,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 130 SyntacticMatches, 17 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=377, Invalid=7812, Unknown=1, NotChecked=0, Total=8190 [2021-12-18 00:58:51,633 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 177 mSDsluCounter, 4201 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 4356 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 685 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-12-18 00:58:51,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 4356 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2088 Invalid, 0 Unknown, 685 Unchecked, 5.9s Time] [2021-12-18 00:58:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-12-18 00:58:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 330. [2021-12-18 00:58:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 231 states have (on average 1.1341991341991342) internal successors, (262), 241 states have internal predecessors, (262), 60 states have call successors, (60), 29 states have call predecessors, (60), 38 states have return successors, (74), 59 states have call predecessors, (74), 59 states have call successors, (74) [2021-12-18 00:58:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 396 transitions. [2021-12-18 00:58:51,651 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 396 transitions. Word has length 116 [2021-12-18 00:58:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:58:51,651 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 396 transitions. [2021-12-18 00:58:51,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 3.0697674418604652) internal successors, (132), 42 states have internal predecessors, (132), 16 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2021-12-18 00:58:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 396 transitions. [2021-12-18 00:58:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-18 00:58:51,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:58:51,653 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:58:51,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-18 00:58:51,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:58:51,866 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:58:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:58:51,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2072626892, now seen corresponding path program 1 times [2021-12-18 00:58:51,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:58:51,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814732657] [2021-12-18 00:58:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:58:51,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:58:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:58:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:58:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:52,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:58:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:58:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:58:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:58:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:58:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 00:58:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:58:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 00:58:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 00:58:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-18 00:58:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:58:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-18 00:58:53,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:58:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814732657] [2021-12-18 00:58:53,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814732657] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:58:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902274350] [2021-12-18 00:58:53,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:58:53,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:58:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:58:53,805 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:58:53,806 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:58:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:58:54,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-18 00:58:54,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:58:54,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 00:58:54,912 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-12-18 00:58:54,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 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:58:54,926 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 10 treesize of output 9 [2021-12-18 00:58:54,940 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 16 treesize of output 15 [2021-12-18 00:58:55,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:55,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2021-12-18 00:58:55,011 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:58:55,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 46 treesize of output 22 [2021-12-18 00:58:57,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:57,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:58:57,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:57,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2021-12-18 00:58:57,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:58,036 INFO L354 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2021-12-18 00:58:58,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 101 [2021-12-18 00:58:58,105 INFO L354 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2021-12-18 00:58:58,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 113 [2021-12-18 00:58:58,115 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:58:58,127 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:58:58,140 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:58:58,202 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 17 treesize of output 13 [2021-12-18 00:58:58,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 00:58:58,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:58:58,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-18 00:58:58,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 00:59:01,327 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 00:59:01,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 00:59:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-18 00:59:04,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:59:05,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7035 (Array Int Int)) (v_ArrVal_7034 (Array Int Int)) (v_ArrVal_7030 Int) (v_ArrVal_7042 (Array Int Int)) (v_ArrVal_7043 (Array Int Int))) (not (= 0 (let ((.cse0 (+ c_aws_linked_list_insert_before_~to_add.offset 8))) (select (select (store (let ((.cse1 (+ c_aws_linked_list_insert_before_~before.offset 8))) (store (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base (store (store (select |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base) c_aws_linked_list_insert_before_~to_add.offset v_ArrVal_7030) .cse0 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_7034) c_aws_linked_list_insert_before_~before.base) .cse1))) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_7043) c_aws_linked_list_insert_before_~before.base) .cse1) v_ArrVal_7042)) c_aws_linked_list_insert_before_~before.base v_ArrVal_7035) c_aws_linked_list_insert_before_~to_add.base) .cse0))))) is different from false [2021-12-18 00:59:05,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902274350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:59:05,542 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:59:05,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2021-12-18 00:59:05,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797300504] [2021-12-18 00:59:05,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 00:59:05,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-18 00:59:05,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:59:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-18 00:59:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1287, Unknown=1, NotChecked=72, Total=1482 [2021-12-18 00:59:05,543 INFO L87 Difference]: Start difference. First operand 330 states and 396 transitions. Second operand has 36 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 34 states have internal predecessors, (120), 14 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2021-12-18 00:59:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:59:12,386 INFO L93 Difference]: Finished difference Result 502 states and 619 transitions. [2021-12-18 00:59:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-18 00:59:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 34 states have internal predecessors, (120), 14 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) Word has length 116 [2021-12-18 00:59:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:59:12,388 INFO L225 Difference]: With dead ends: 502 [2021-12-18 00:59:12,388 INFO L226 Difference]: Without dead ends: 351 [2021-12-18 00:59:12,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 138 SyntacticMatches, 15 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=302, Invalid=3361, Unknown=1, NotChecked=118, Total=3782 [2021-12-18 00:59:12,390 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 102 mSDsluCounter, 3003 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-18 00:59:12,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 3174 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 925 Invalid, 0 Unknown, 377 Unchecked, 2.6s Time] [2021-12-18 00:59:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-12-18 00:59:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 329. [2021-12-18 00:59:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 233 states have (on average 1.1201716738197425) internal successors, (261), 241 states have internal predecessors, (261), 58 states have call successors, (58), 30 states have call predecessors, (58), 37 states have return successors, (68), 57 states have call predecessors, (68), 57 states have call successors, (68) [2021-12-18 00:59:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 387 transitions. [2021-12-18 00:59:12,419 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 387 transitions. Word has length 116 [2021-12-18 00:59:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:59:12,419 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 387 transitions. [2021-12-18 00:59:12,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 34 states have internal predecessors, (120), 14 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (24), 11 states have call predecessors, (24), 13 states have call successors, (24) [2021-12-18 00:59:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 387 transitions. [2021-12-18 00:59:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-12-18 00:59:12,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:59:12,421 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:59:12,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-18 00:59:12,642 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,SelfDestructingSolverStorable23 [2021-12-18 00:59:12,643 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:59:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:59:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1360457194, now seen corresponding path program 1 times [2021-12-18 00:59:12,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:59:12,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007579620] [2021-12-18 00:59:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:59:12,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:59:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:59:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:59:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-18 00:59:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:59:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-12-18 00:59:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 00:59:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:59:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-18 00:59:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-18 00:59:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-18 00:59:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 00:59:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-18 00:59:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-18 00:59:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-18 00:59:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 00:59:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-18 00:59:12,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:59:12,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007579620] [2021-12-18 00:59:12,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007579620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:59:12,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:59:12,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 00:59:12,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054401106] [2021-12-18 00:59:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:59:12,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:59:12,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:59:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:59:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:59:12,971 INFO L87 Difference]: Start difference. First operand 329 states and 387 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-18 00:59:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:59:13,262 INFO L93 Difference]: Finished difference Result 335 states and 392 transitions. [2021-12-18 00:59:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:59:13,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2021-12-18 00:59:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:59:13,264 INFO L225 Difference]: With dead ends: 335 [2021-12-18 00:59:13,264 INFO L226 Difference]: Without dead ends: 333 [2021-12-18 00:59:13,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:59:13,264 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 8 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:59:13,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 572 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:59:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-12-18 00:59:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2021-12-18 00:59:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 236 states have (on average 1.11864406779661) internal successors, (264), 244 states have internal predecessors, (264), 58 states have call successors, (58), 31 states have call predecessors, (58), 38 states have return successors, (68), 57 states have call predecessors, (68), 57 states have call successors, (68) [2021-12-18 00:59:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 390 transitions. [2021-12-18 00:59:13,280 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 390 transitions. Word has length 123 [2021-12-18 00:59:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:59:13,281 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 390 transitions. [2021-12-18 00:59:13,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-18 00:59:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 390 transitions. [2021-12-18 00:59:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-18 00:59:13,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:59:13,282 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:13,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-18 00:59:13,282 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:59:13,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:59:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1211535867, now seen corresponding path program 1 times [2021-12-18 00:59:13,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:59:13,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850597761] [2021-12-18 00:59:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:59:13,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:59:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:59:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-18 00:59:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 00:59:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-18 00:59:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-18 00:59:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 00:59:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-18 00:59:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-18 00:59:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:59:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-18 00:59:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:13,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-18 00:59:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-18 00:59:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 00:59:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:14,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-18 00:59:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-18 00:59:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-18 00:59:14,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:59:14,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850597761] [2021-12-18 00:59:14,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850597761] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:59:14,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845479466] [2021-12-18 00:59:14,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:59:14,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:59:14,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:59:14,701 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:59:14,702 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:59:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:59:15,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 272 conjunts are in the unsatisfiable core [2021-12-18 00:59:15,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:59:15,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-18 00:59:15,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 00:59:15,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:15,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 00:59:15,765 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 00:59:15,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:15,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 00:59:16,160 INFO L354 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2021-12-18 00:59:16,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 97 [2021-12-18 00:59:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:16,172 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 93 treesize of output 79 [2021-12-18 00:59:16,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:16,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:16,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2021-12-18 00:59:16,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:16,201 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 16 treesize of output 20 [2021-12-18 00:59:16,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, 0 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:59:16,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:16,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-18 00:59:16,241 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:59:19,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:19,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 00:59:19,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 00:59:19,422 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-18 00:59:19,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 32 [2021-12-18 01:00:09,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,235 INFO L354 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2021-12-18 01:00:09,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 358 treesize of output 328 [2021-12-18 01:00:09,394 INFO L354 Elim1Store]: treesize reduction 162, result has 11.5 percent of original size [2021-12-18 01:00:09,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 345 treesize of output 333 [2021-12-18 01:00:09,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 40 [2021-12-18 01:00:09,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2021-12-18 01:00:09,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 01:00:09,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2021-12-18 01:00:09,486 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 01:00:09,505 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 10 treesize of output 9 [2021-12-18 01:00:09,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:00:09,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-12-18 01:00:09,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 01:00:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-12-18 01:00:19,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:00:23,180 INFO L354 Elim1Store]: treesize reduction 165, result has 35.3 percent of original size [2021-12-18 01:00:23,181 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 6 case distinctions, treesize of input 2154 treesize of output 1683 [2021-12-18 01:00:23,615 INFO L354 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2021-12-18 01:00:23,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8085 treesize of output 7835 [2021-12-18 01:00:24,056 INFO L354 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2021-12-18 01:00:24,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 13317 treesize of output 13056 Killed by 15