./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.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 f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:53:13,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:53:13,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:53:13,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:53:13,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:53:13,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:53:13,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:53:13,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:53:13,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:53:13,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:53:13,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:53:13,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:53:13,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:53:13,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:53:13,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:53:13,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:53:13,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:53:13,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:53:13,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:53:13,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:53:13,916 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:53:13,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:53:13,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:53:13,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:53:13,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:53:13,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:53:13,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:53:13,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:53:13,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:53:13,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:53:13,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:53:13,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:53:13,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:53:13,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:53:13,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:53:13,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:53:13,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:53:13,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:53:13,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:53:13,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:53:13,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:53:13,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:53:13,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 09:53:13,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:53:13,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:53:13,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:53:13,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:53:13,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:53:13,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:53:13,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:53:13,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:53:13,960 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:53:13,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:53:13,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:53:13,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:53:13,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:53:13,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:53:13,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:53:13,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:53:13,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:53:13,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:53:13,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:53:13,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:53:13,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:53:13,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:53:13,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:53:13,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:53:13,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:53:13,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:53:13,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:53:13,975 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:53:13,975 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:53:13,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:53:13,976 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 -> f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 [2022-07-21 09:53:14,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:53:14,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:53:14,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:53:14,197 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:53:14,198 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:53:14,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-21 09:53:14,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85c20a2a/da54b2380c964a94900573bf435ab06b/FLAG7bdedefa5 [2022-07-21 09:53:14,835 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:53:14,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-21 09:53:14,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85c20a2a/da54b2380c964a94900573bf435ab06b/FLAG7bdedefa5 [2022-07-21 09:53:15,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85c20a2a/da54b2380c964a94900573bf435ab06b [2022-07-21 09:53:15,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:53:15,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:53:15,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:53:15,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:53:15,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:53:15,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:53:15" (1/1) ... [2022-07-21 09:53:15,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b74316d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:15, skipping insertion in model container [2022-07-21 09:53:15,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:53:15" (1/1) ... [2022-07-21 09:53:15,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:53:15,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:53:16,238 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/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-07-21 09:53:16,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:53:16,308 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:53:16,523 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/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-07-21 09:53:16,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:53:16,590 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:53:16,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16 WrapperNode [2022-07-21 09:53:16,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:53:16,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:53:16,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:53:16,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:53:16,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,783 INFO L137 Inliner]: procedures = 236, calls = 1201, calls flagged for inlining = 124, calls inlined = 121, statements flattened = 3745 [2022-07-21 09:53:16,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:53:16,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:53:16,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:53:16,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:53:16,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:53:16,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:53:16,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:53:16,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:53:16,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (1/1) ... [2022-07-21 09:53:16,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:53:16,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:16,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 09:53:17,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 09:53:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2022-07-21 09:53:17,022 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2022-07-21 09:53:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 09:53:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 09:53:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure vfs_fsync [2022-07-21 09:53:17,023 INFO L138 BoogieDeclarations]: Found implementation of procedure vfs_fsync [2022-07-21 09:53:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-21 09:53:17,023 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-21 09:53:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 09:53:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 09:53:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 09:53:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 09:53:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure add_disk [2022-07-21 09:53:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure add_disk [2022-07-21 09:53:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_uevent [2022-07-21 09:53:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_uevent [2022-07-21 09:53:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-21 09:53:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-21 09:53:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_xor [2022-07-21 09:53:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_xor [2022-07-21 09:53:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure invalidate_bdev [2022-07-21 09:53:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure invalidate_bdev [2022-07-21 09:53:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-21 09:53:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-21 09:53:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 09:53:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 09:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure huge_encode_dev [2022-07-21 09:53:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure huge_encode_dev [2022-07-21 09:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure lo_do_transfer [2022-07-21 09:53:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_do_transfer [2022-07-21 09:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure loop_sysfs_exit [2022-07-21 09:53:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_sysfs_exit [2022-07-21 09:53:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-21 09:53:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-21 09:53:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_should_stop [2022-07-21 09:53:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_should_stop [2022-07-21 09:53:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 09:53:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 09:53:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure loop_alloc [2022-07-21 09:53:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_alloc [2022-07-21 09:53:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure loop_make_request [2022-07-21 09:53:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_make_request [2022-07-21 09:53:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure __do_lo_send_write [2022-07-21 09:53:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_lo_send_write [2022-07-21 09:53:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure loop_get_status [2022-07-21 09:53:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_get_status [2022-07-21 09:53:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure loop_clr_fd [2022-07-21 09:53:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_clr_fd [2022-07-21 09:53:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:53:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure figure_loop_size [2022-07-21 09:53:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure figure_loop_size [2022-07-21 09:53:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure ioctl_by_bdev [2022-07-21 09:53:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ioctl_by_bdev [2022-07-21 09:53:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 09:53:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-21 09:53:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-21 09:53:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:53:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 09:53:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 09:53:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 09:53:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-21 09:53:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-21 09:53:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure fput [2022-07-21 09:53:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure fput [2022-07-21 09:53:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-21 09:53:17,033 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-21 09:53:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_capacity [2022-07-21 09:53:17,033 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_capacity [2022-07-21 09:53:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_empty [2022-07-21 09:53:17,033 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_empty [2022-07-21 09:53:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 09:53:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-21 09:53:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-21 09:53:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure loop_free [2022-07-21 09:53:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_free [2022-07-21 09:53:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_none [2022-07-21 09:53:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_none [2022-07-21 09:53:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 09:53:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure bd_set_size [2022-07-21 09:53:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure bd_set_size [2022-07-21 09:53:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:53:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure fget [2022-07-21 09:53:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure fget [2022-07-21 09:53:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_set_gfp_mask [2022-07-21 09:53:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_set_gfp_mask [2022-07-21 09:53:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure xor_init [2022-07-21 09:53:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure xor_init [2022-07-21 09:53:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure kmap [2022-07-21 09:53:17,035 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap [2022-07-21 09:53:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 09:53:17,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 09:53:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 09:53:17,036 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 09:53:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-21 09:53:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-21 09:53:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-21 09:53:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-21 09:53:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:53:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-21 09:53:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-21 09:53:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure __kmap_atomic [2022-07-21 09:53:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmap_atomic [2022-07-21 09:53:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-21 09:53:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-21 09:53:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:53:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-21 09:53:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-21 09:53:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:53:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure get_loop_size [2022-07-21 09:53:17,039 INFO L138 BoogieDeclarations]: Found implementation of procedure get_loop_size [2022-07-21 09:53:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 09:53:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-21 09:53:17,040 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-21 09:53:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_status [2022-07-21 09:53:17,040 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_status [2022-07-21 09:53:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 09:53:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure lo_ioctl [2022-07-21 09:53:17,041 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_ioctl [2022-07-21 09:53:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-21 09:53:17,043 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-21 09:53:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-21 09:53:17,043 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-21 09:53:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure loop_release_xfer [2022-07-21 09:53:17,045 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_release_xfer [2022-07-21 09:53:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure _cond_resched [2022-07-21 09:53:17,045 INFO L138 BoogieDeclarations]: Found implementation of procedure _cond_resched [2022-07-21 09:53:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure kunmap [2022-07-21 09:53:17,045 INFO L138 BoogieDeclarations]: Found implementation of procedure kunmap [2022-07-21 09:53:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-21 09:53:17,049 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-21 09:53:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure loop_switch [2022-07-21 09:53:17,049 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_switch [2022-07-21 09:53:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_gfp_mask [2022-07-21 09:53:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_gfp_mask [2022-07-21 09:53:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 09:53:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 09:53:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-21 09:53:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-21 09:53:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2022-07-21 09:53:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2022-07-21 09:53:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:53:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:53:17,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:53:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 09:53:17,051 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 09:53:17,583 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:53:17,587 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:53:18,039 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:18,999 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-07-21 09:53:18,999 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-07-21 09:53:19,012 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-21 09:53:19,012 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-21 09:53:19,340 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-21 09:53:19,341 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-21 09:53:19,605 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:19,606 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 09:53:20,471 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##72: assume !false; [2022-07-21 09:53:20,472 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume false; [2022-07-21 09:53:20,472 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-21 09:53:20,472 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-21 09:53:20,502 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:53:20,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:53:20,512 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 09:53:20,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:53:20 BoogieIcfgContainer [2022-07-21 09:53:20,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:53:20,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:53:20,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:53:20,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:53:20,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:53:15" (1/3) ... [2022-07-21 09:53:20,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659faab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:53:20, skipping insertion in model container [2022-07-21 09:53:20,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:53:16" (2/3) ... [2022-07-21 09:53:20,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659faab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:53:20, skipping insertion in model container [2022-07-21 09:53:20,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:53:20" (3/3) ... [2022-07-21 09:53:20,520 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-21 09:53:20,529 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:53:20,529 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:53:20,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:53:20,578 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1aa7bd70, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b2aa791 [2022-07-21 09:53:20,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 09:53:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) [2022-07-21 09:53:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 09:53:20,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:20,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:20,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1638152850, now seen corresponding path program 1 times [2022-07-21 09:53:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:20,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187423292] [2022-07-21 09:53:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:53:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:20,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187423292] [2022-07-21 09:53:20,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187423292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:20,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:20,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:53:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338577578] [2022-07-21 09:53:20,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:20,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:53:20,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:53:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:53:20,879 INFO L87 Difference]: Start difference. First operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:53:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:21,185 INFO L93 Difference]: Finished difference Result 3311 states and 4739 transitions. [2022-07-21 09:53:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:53:21,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 09:53:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:21,209 INFO L225 Difference]: With dead ends: 3311 [2022-07-21 09:53:21,210 INFO L226 Difference]: Without dead ends: 2166 [2022-07-21 09:53:21,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:53:21,236 INFO L413 NwaCegarLoop]: 1914 mSDtfsCounter, 1542 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:21,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 3378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:53:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2022-07-21 09:53:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2163. [2022-07-21 09:53:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-21 09:53:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2986 transitions. [2022-07-21 09:53:21,399 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2986 transitions. Word has length 11 [2022-07-21 09:53:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:21,400 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2986 transitions. [2022-07-21 09:53:21,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 09:53:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2986 transitions. [2022-07-21 09:53:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 09:53:21,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:21,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:21,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:53:21,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash -780115607, now seen corresponding path program 1 times [2022-07-21 09:53:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:21,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571134605] [2022-07-21 09:53:21,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:21,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-21 09:53:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:53:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:21,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571134605] [2022-07-21 09:53:21,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571134605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:21,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:21,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:53:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62036013] [2022-07-21 09:53:21,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:21,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:53:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:53:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:53:21,565 INFO L87 Difference]: Start difference. First operand 2163 states and 2986 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:23,117 INFO L93 Difference]: Finished difference Result 4691 states and 6565 transitions. [2022-07-21 09:53:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:53:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-07-21 09:53:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:23,155 INFO L225 Difference]: With dead ends: 4691 [2022-07-21 09:53:23,155 INFO L226 Difference]: Without dead ends: 2609 [2022-07-21 09:53:23,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:53:23,162 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 565 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 4348 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:23,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 4348 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 09:53:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-21 09:53:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-21 09:53:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-21 09:53:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2984 transitions. [2022-07-21 09:53:23,234 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2984 transitions. Word has length 46 [2022-07-21 09:53:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:23,235 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2984 transitions. [2022-07-21 09:53:23,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2984 transitions. [2022-07-21 09:53:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 09:53:23,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:23,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:23,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:53:23,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:23,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:23,238 INFO L85 PathProgramCache]: Analyzing trace with hash -800617350, now seen corresponding path program 1 times [2022-07-21 09:53:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:23,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132505803] [2022-07-21 09:53:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:23,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 09:53:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 09:53:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:53:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:23,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132505803] [2022-07-21 09:53:23,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132505803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:23,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:23,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:53:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463961405] [2022-07-21 09:53:23,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:23,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:53:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:53:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:53:23,310 INFO L87 Difference]: Start difference. First operand 2163 states and 2984 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:24,333 INFO L93 Difference]: Finished difference Result 4764 states and 6650 transitions. [2022-07-21 09:53:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:53:24,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-21 09:53:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:24,345 INFO L225 Difference]: With dead ends: 4764 [2022-07-21 09:53:24,345 INFO L226 Difference]: Without dead ends: 2609 [2022-07-21 09:53:24,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:53:24,353 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 2078 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2231 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:24,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2231 Valid, 2196 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 09:53:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-21 09:53:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-21 09:53:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-21 09:53:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2982 transitions. [2022-07-21 09:53:24,412 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2982 transitions. Word has length 58 [2022-07-21 09:53:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:24,413 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2982 transitions. [2022-07-21 09:53:24,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2982 transitions. [2022-07-21 09:53:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 09:53:24,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:24,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:24,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:53:24,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash -973306474, now seen corresponding path program 1 times [2022-07-21 09:53:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:24,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681500381] [2022-07-21 09:53:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 09:53:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 09:53:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:53:24,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:24,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681500381] [2022-07-21 09:53:24,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681500381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:24,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:24,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:53:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264230079] [2022-07-21 09:53:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:24,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:53:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:24,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:53:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:53:24,502 INFO L87 Difference]: Start difference. First operand 2163 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:26,000 INFO L93 Difference]: Finished difference Result 4691 states and 6560 transitions. [2022-07-21 09:53:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:53:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-21 09:53:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:26,011 INFO L225 Difference]: With dead ends: 4691 [2022-07-21 09:53:26,011 INFO L226 Difference]: Without dead ends: 2592 [2022-07-21 09:53:26,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:53:26,019 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 565 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 4334 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:26,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 4334 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-21 09:53:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-07-21 09:53:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2146. [2022-07-21 09:53:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 1599 states have (on average 1.3176985616010006) internal successors, (2107), 1619 states have internal predecessors, (2107), 425 states have call successors, (425), 122 states have call predecessors, (425), 121 states have return successors, (428), 421 states have call predecessors, (428), 423 states have call successors, (428) [2022-07-21 09:53:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2960 transitions. [2022-07-21 09:53:26,087 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2960 transitions. Word has length 51 [2022-07-21 09:53:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:26,088 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 2960 transitions. [2022-07-21 09:53:26,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2960 transitions. [2022-07-21 09:53:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 09:53:26,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:26,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:26,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:53:26,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash 966613706, now seen corresponding path program 1 times [2022-07-21 09:53:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:26,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770378935] [2022-07-21 09:53:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:26,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 09:53:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:26,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:53:26,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:26,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770378935] [2022-07-21 09:53:26,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770378935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:26,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:26,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:53:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627928405] [2022-07-21 09:53:26,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:26,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:53:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:53:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:53:26,235 INFO L87 Difference]: Start difference. First operand 2146 states and 2960 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:27,474 INFO L93 Difference]: Finished difference Result 4690 states and 6558 transitions. [2022-07-21 09:53:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:53:27,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2022-07-21 09:53:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:27,486 INFO L225 Difference]: With dead ends: 4690 [2022-07-21 09:53:27,486 INFO L226 Difference]: Without dead ends: 2598 [2022-07-21 09:53:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:53:27,494 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 738 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 3227 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:27,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 3227 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 09:53:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2022-07-21 09:53:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2147. [2022-07-21 09:53:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1600 states have (on average 1.3175) internal successors, (2108), 1620 states have internal predecessors, (2108), 425 states have call successors, (425), 122 states have call predecessors, (425), 121 states have return successors, (428), 421 states have call predecessors, (428), 423 states have call successors, (428) [2022-07-21 09:53:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2961 transitions. [2022-07-21 09:53:27,559 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2961 transitions. Word has length 63 [2022-07-21 09:53:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:27,560 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 2961 transitions. [2022-07-21 09:53:27,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 09:53:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2961 transitions. [2022-07-21 09:53:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 09:53:27,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:27,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:27,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:53:27,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:27,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:27,563 INFO L85 PathProgramCache]: Analyzing trace with hash 707532724, now seen corresponding path program 1 times [2022-07-21 09:53:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:27,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610360693] [2022-07-21 09:53:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:27,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:27,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:53:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:27,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 09:53:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:53:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610360693] [2022-07-21 09:53:27,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610360693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:53:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803679624] [2022-07-21 09:53:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:27,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:27,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:53:27,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 09:53:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:28,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 09:53:28,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:53:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:53:28,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:53:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 09:53:28,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803679624] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:53:28,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:53:28,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-07-21 09:53:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789513372] [2022-07-21 09:53:28,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:53:28,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 09:53:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:28,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 09:53:28,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:53:28,346 INFO L87 Difference]: Start difference. First operand 2147 states and 2961 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-21 09:53:32,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 09:53:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:34,307 INFO L93 Difference]: Finished difference Result 4887 states and 6970 transitions. [2022-07-21 09:53:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 09:53:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 87 [2022-07-21 09:53:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:34,319 INFO L225 Difference]: With dead ends: 4887 [2022-07-21 09:53:34,319 INFO L226 Difference]: Without dead ends: 2795 [2022-07-21 09:53:34,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-21 09:53:34,325 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 1002 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 421 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 5689 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:34,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 5689 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2770 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-21 09:53:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2022-07-21 09:53:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2165. [2022-07-21 09:53:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 1612 states have (on average 1.315136476426799) internal successors, (2120), 1632 states have internal predecessors, (2120), 431 states have call successors, (431), 122 states have call predecessors, (431), 121 states have return successors, (434), 427 states have call predecessors, (434), 429 states have call successors, (434) [2022-07-21 09:53:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 2985 transitions. [2022-07-21 09:53:34,393 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 2985 transitions. Word has length 87 [2022-07-21 09:53:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:34,394 INFO L495 AbstractCegarLoop]: Abstraction has 2165 states and 2985 transitions. [2022-07-21 09:53:34,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-21 09:53:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2985 transitions. [2022-07-21 09:53:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-21 09:53:34,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:34,396 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:34,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 09:53:34,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-21 09:53:34,612 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:34,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2065381788, now seen corresponding path program 1 times [2022-07-21 09:53:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:34,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993268660] [2022-07-21 09:53:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:34,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:53:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:53:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:53:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:53:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:53:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 09:53:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 09:53:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-21 09:53:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993268660] [2022-07-21 09:53:34,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993268660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:53:34,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391823653] [2022-07-21 09:53:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:34,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:34,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:34,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:53:34,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 09:53:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:35,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 1827 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:53:35,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:53:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-21 09:53:35,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:53:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-21 09:53:35,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391823653] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:53:35,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:53:35,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2022-07-21 09:53:35,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834920213] [2022-07-21 09:53:35,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:53:35,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 09:53:35,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:35,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 09:53:35,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:53:35,782 INFO L87 Difference]: Start difference. First operand 2165 states and 2985 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-07-21 09:53:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:41,260 INFO L93 Difference]: Finished difference Result 4911 states and 7003 transitions. [2022-07-21 09:53:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 09:53:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) Word has length 152 [2022-07-21 09:53:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:41,271 INFO L225 Difference]: With dead ends: 4911 [2022-07-21 09:53:41,271 INFO L226 Difference]: Without dead ends: 2819 [2022-07-21 09:53:41,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2022-07-21 09:53:41,277 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 1069 mSDsluCounter, 7468 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 8880 SdHoareTripleChecker+Invalid, 5182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 4697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:41,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 8880 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 4697 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-21 09:53:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2022-07-21 09:53:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2189. [2022-07-21 09:53:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1628 states have (on average 1.3120393120393121) internal successors, (2136), 1648 states have internal predecessors, (2136), 439 states have call successors, (439), 122 states have call predecessors, (439), 121 states have return successors, (442), 435 states have call predecessors, (442), 437 states have call successors, (442) [2022-07-21 09:53:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3017 transitions. [2022-07-21 09:53:41,343 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3017 transitions. Word has length 152 [2022-07-21 09:53:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:41,343 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 3017 transitions. [2022-07-21 09:53:41,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-07-21 09:53:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3017 transitions. [2022-07-21 09:53:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-21 09:53:41,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:41,348 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:41,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 09:53:41,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-21 09:53:41,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1776723700, now seen corresponding path program 2 times [2022-07-21 09:53:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:41,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094710354] [2022-07-21 09:53:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:53:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:53:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:53:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:53:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:53:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:53:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 09:53:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:53:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:53:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 09:53:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:53:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 09:53:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:53:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 09:53:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 09:53:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2022-07-21 09:53:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094710354] [2022-07-21 09:53:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094710354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:53:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102504496] [2022-07-21 09:53:41,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:53:41,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:41,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:53:41,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 09:53:42,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 09:53:42,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:53:42,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-21 09:53:42,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:53:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-21 09:53:42,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:53:42,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102504496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:42,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:53:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-21 09:53:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760933050] [2022-07-21 09:53:42,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:42,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:53:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:53:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-21 09:53:42,549 INFO L87 Difference]: Start difference. First operand 2189 states and 3017 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 09:53:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:43,555 INFO L93 Difference]: Finished difference Result 5268 states and 7285 transitions. [2022-07-21 09:53:43,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:53:43,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 248 [2022-07-21 09:53:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:43,571 INFO L225 Difference]: With dead ends: 5268 [2022-07-21 09:53:43,571 INFO L226 Difference]: Without dead ends: 4209 [2022-07-21 09:53:43,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-21 09:53:43,576 INFO L413 NwaCegarLoop]: 2816 mSDtfsCounter, 1662 mSDsluCounter, 12218 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 15034 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:43,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 15034 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 09:53:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4209 states. [2022-07-21 09:53:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4209 to 4155. [2022-07-21 09:53:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 3084 states have (on average 1.3167963683527886) internal successors, (4061), 3123 states have internal predecessors, (4061), 833 states have call successors, (833), 236 states have call predecessors, (833), 237 states have return successors, (849), 827 states have call predecessors, (849), 831 states have call successors, (849) [2022-07-21 09:53:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5743 transitions. [2022-07-21 09:53:43,732 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5743 transitions. Word has length 248 [2022-07-21 09:53:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:43,733 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 5743 transitions. [2022-07-21 09:53:43,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 09:53:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5743 transitions. [2022-07-21 09:53:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-21 09:53:43,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:43,737 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:43,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 09:53:43,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:43,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1557868982, now seen corresponding path program 1 times [2022-07-21 09:53:43,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:43,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598355248] [2022-07-21 09:53:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:43,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:53:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:53:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:53:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:53:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:53:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:53:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 09:53:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:53:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:53:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 09:53:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:53:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 09:53:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:53:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 09:53:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 09:53:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2022-07-21 09:53:44,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:44,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598355248] [2022-07-21 09:53:44,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598355248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:44,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:44,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:53:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538451342] [2022-07-21 09:53:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:44,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:53:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:44,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:53:44,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:53:44,277 INFO L87 Difference]: Start difference. First operand 4155 states and 5743 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:53:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:49,723 INFO L93 Difference]: Finished difference Result 8065 states and 11861 transitions. [2022-07-21 09:53:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 09:53:49,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 248 [2022-07-21 09:53:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:49,776 INFO L225 Difference]: With dead ends: 8065 [2022-07-21 09:53:49,776 INFO L226 Difference]: Without dead ends: 8062 [2022-07-21 09:53:49,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:53:49,779 INFO L413 NwaCegarLoop]: 2912 mSDtfsCounter, 5886 mSDsluCounter, 3328 mSDsCounter, 0 mSdLazyCounter, 3782 mSolverCounterSat, 2545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 6240 SdHoareTripleChecker+Invalid, 6327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2545 IncrementalHoareTripleChecker+Valid, 3782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:49,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 6240 Invalid, 6327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2545 Valid, 3782 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-21 09:53:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-07-21 09:53:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 6361. [2022-07-21 09:53:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6361 states, 4707 states have (on average 1.318249415763756) internal successors, (6205), 4778 states have internal predecessors, (6205), 1285 states have call successors, (1285), 349 states have call predecessors, (1285), 368 states have return successors, (1386), 1289 states have call predecessors, (1386), 1283 states have call successors, (1386) [2022-07-21 09:53:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 8876 transitions. [2022-07-21 09:53:50,005 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 8876 transitions. Word has length 248 [2022-07-21 09:53:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:50,005 INFO L495 AbstractCegarLoop]: Abstraction has 6361 states and 8876 transitions. [2022-07-21 09:53:50,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:53:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 8876 transitions. [2022-07-21 09:53:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-07-21 09:53:50,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:50,010 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:50,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 09:53:50,011 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1635323117, now seen corresponding path program 1 times [2022-07-21 09:53:50,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:50,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937455698] [2022-07-21 09:53:50,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:50,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:53:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:53:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:53:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:53:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:53:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:53:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 09:53:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:53:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:53:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 09:53:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:53:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 09:53:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:53:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 09:53:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 09:53:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-21 09:53:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-21 09:53:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:50,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937455698] [2022-07-21 09:53:50,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937455698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:50,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:53:50,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:53:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059472116] [2022-07-21 09:53:50,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:50,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:53:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:50,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:53:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:53:50,333 INFO L87 Difference]: Start difference. First operand 6361 states and 8876 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:53:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:52,405 INFO L93 Difference]: Finished difference Result 14925 states and 21806 transitions. [2022-07-21 09:53:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:53:52,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 254 [2022-07-21 09:53:52,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:52,436 INFO L225 Difference]: With dead ends: 14925 [2022-07-21 09:53:52,436 INFO L226 Difference]: Without dead ends: 8671 [2022-07-21 09:53:52,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:53:52,456 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 1201 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:52,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 3259 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 09:53:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8671 states. [2022-07-21 09:53:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8671 to 7004. [2022-07-21 09:53:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7004 states, 5188 states have (on average 1.3299922898997687) internal successors, (6900), 5271 states have internal predecessors, (6900), 1447 states have call successors, (1447), 349 states have call predecessors, (1447), 368 states have return successors, (1586), 1445 states have call predecessors, (1586), 1445 states have call successors, (1586) [2022-07-21 09:53:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 9933 transitions. [2022-07-21 09:53:52,748 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 9933 transitions. Word has length 254 [2022-07-21 09:53:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:52,749 INFO L495 AbstractCegarLoop]: Abstraction has 7004 states and 9933 transitions. [2022-07-21 09:53:52,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 09:53:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 9933 transitions. [2022-07-21 09:53:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-21 09:53:52,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:52,753 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:52,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 09:53:52,753 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1210188346, now seen corresponding path program 1 times [2022-07-21 09:53:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:52,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226594827] [2022-07-21 09:53:52,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:52,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 09:53:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 09:53:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 09:53:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 09:53:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 09:53:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 09:53:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 09:53:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 09:53:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 09:53:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 09:53:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 09:53:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 09:53:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 09:53:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 09:53:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-21 09:53:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-21 09:53:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2022-07-21 09:53:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:53,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226594827] [2022-07-21 09:53:53,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226594827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:53:53,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604871995] [2022-07-21 09:53:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:53,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:53,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:53,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:53:53,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 09:53:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:53,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-21 09:53:53,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:53:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-07-21 09:53:53,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:53:53,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604871995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:53,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:53:53,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 09:53:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518387363] [2022-07-21 09:53:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:53,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:53:53,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:53:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:53:53,768 INFO L87 Difference]: Start difference. First operand 7004 states and 9933 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:53:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:53,981 INFO L93 Difference]: Finished difference Result 14011 states and 19874 transitions. [2022-07-21 09:53:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:53:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 256 [2022-07-21 09:53:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:54,006 INFO L225 Difference]: With dead ends: 14011 [2022-07-21 09:53:54,007 INFO L226 Difference]: Without dead ends: 6993 [2022-07-21 09:53:54,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:53:54,029 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 0 mSDsluCounter, 4578 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6108 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:54,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6108 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 09:53:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6993 states. [2022-07-21 09:53:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6993 to 6993. [2022-07-21 09:53:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 5181 states have (on average 1.3298591005597376) internal successors, (6890), 5263 states have internal predecessors, (6890), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 366 states have return successors, (1584), 1443 states have call predecessors, (1584), 1443 states have call successors, (1584) [2022-07-21 09:53:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 9919 transitions. [2022-07-21 09:53:54,300 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 9919 transitions. Word has length 256 [2022-07-21 09:53:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:54,300 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 9919 transitions. [2022-07-21 09:53:54,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 09:53:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 9919 transitions. [2022-07-21 09:53:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-07-21 09:53:54,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:54,306 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:54,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 09:53:54,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:54,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:54,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1841619178, now seen corresponding path program 1 times [2022-07-21 09:53:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:54,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169393543] [2022-07-21 09:53:54,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 09:53:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:53:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 09:53:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 09:53:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 09:53:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 09:53:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 09:53:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 09:53:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 09:53:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-21 09:53:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-21 09:53:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-21 09:53:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-21 09:53:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-07-21 09:53:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-21 09:53:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 09:53:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-21 09:53:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-07-21 09:53:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-21 09:53:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-21 09:53:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 15 proven. 186 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2022-07-21 09:53:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:55,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169393543] [2022-07-21 09:53:55,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169393543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:53:55,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361993100] [2022-07-21 09:53:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:55,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:55,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:53:55,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 09:53:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:56,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 4690 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 09:53:56,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:53:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-07-21 09:53:56,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:53:56,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361993100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:53:56,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:53:56,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2022-07-21 09:53:56,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251887968] [2022-07-21 09:53:56,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:53:56,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:53:56,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:53:56,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:53:56,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 09:53:56,789 INFO L87 Difference]: Start difference. First operand 6993 states and 9919 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:53:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:53:57,087 INFO L93 Difference]: Finished difference Result 13986 states and 19859 transitions. [2022-07-21 09:53:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:53:57,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 440 [2022-07-21 09:53:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:53:57,110 INFO L225 Difference]: With dead ends: 13986 [2022-07-21 09:53:57,110 INFO L226 Difference]: Without dead ends: 7001 [2022-07-21 09:53:57,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 541 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-21 09:53:57,128 INFO L413 NwaCegarLoop]: 1517 mSDtfsCounter, 6 mSDsluCounter, 9082 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10599 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 09:53:57,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10599 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 09:53:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2022-07-21 09:53:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 6995. [2022-07-21 09:53:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 5182 states have (on average 1.3297954457738326) internal successors, (6891), 5265 states have internal predecessors, (6891), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 367 states have return successors, (1590), 1443 states have call predecessors, (1590), 1443 states have call successors, (1590) [2022-07-21 09:53:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9926 transitions. [2022-07-21 09:53:57,354 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9926 transitions. Word has length 440 [2022-07-21 09:53:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:53:57,355 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9926 transitions. [2022-07-21 09:53:57,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 09:53:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9926 transitions. [2022-07-21 09:53:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2022-07-21 09:53:57,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:53:57,363 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:53:57,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 09:53:57,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 09:53:57,592 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:53:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:53:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash -969582626, now seen corresponding path program 1 times [2022-07-21 09:53:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:53:57,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791951379] [2022-07-21 09:53:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:53:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:53:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 09:53:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 09:53:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 09:53:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 09:53:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 09:53:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 09:53:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 09:53:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 09:53:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 09:53:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 09:53:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-21 09:53:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-21 09:53:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-07-21 09:53:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2022-07-21 09:53:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:53:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:53:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:53:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 09:53:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 09:53:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-07-21 09:53:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-21 09:53:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2022-07-21 09:53:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2022-07-21 09:53:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:53:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 19 proven. 112 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2022-07-21 09:53:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:53:58,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791951379] [2022-07-21 09:53:58,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791951379] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:53:58,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174655999] [2022-07-21 09:53:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:53:58,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:53:58,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:53:58,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:53:58,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 09:54:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:00,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 4986 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-21 09:54:00,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:54:00,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 09:54:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 317 proven. 2 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2022-07-21 09:54:00,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:54:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 17 proven. 142 refuted. 0 times theorem prover too weak. 2129 trivial. 0 not checked. [2022-07-21 09:54:01,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174655999] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:54:01,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:54:01,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 6] total 22 [2022-07-21 09:54:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854659245] [2022-07-21 09:54:01,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:54:01,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 09:54:01,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:54:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 09:54:01,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-07-21 09:54:01,175 INFO L87 Difference]: Start difference. First operand 6995 states and 9926 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2022-07-21 09:54:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 09:54:10,044 INFO L93 Difference]: Finished difference Result 15645 states and 22950 transitions. [2022-07-21 09:54:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 09:54:10,045 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) Word has length 496 [2022-07-21 09:54:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 09:54:10,135 INFO L225 Difference]: With dead ends: 15645 [2022-07-21 09:54:10,135 INFO L226 Difference]: Without dead ends: 8657 [2022-07-21 09:54:10,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1095 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 09:54:10,151 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 703 mSDsluCounter, 15147 mSDsCounter, 0 mSdLazyCounter, 9490 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 16532 SdHoareTripleChecker+Invalid, 9837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 9490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-21 09:54:10,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 16532 Invalid, 9837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 9490 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-07-21 09:54:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2022-07-21 09:54:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 6995. [2022-07-21 09:54:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 5182 states have (on average 1.3297954457738326) internal successors, (6891), 5265 states have internal predecessors, (6891), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 367 states have return successors, (1588), 1443 states have call predecessors, (1588), 1443 states have call successors, (1588) [2022-07-21 09:54:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9924 transitions. [2022-07-21 09:54:10,399 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9924 transitions. Word has length 496 [2022-07-21 09:54:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 09:54:10,399 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9924 transitions. [2022-07-21 09:54:10,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2022-07-21 09:54:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9924 transitions. [2022-07-21 09:54:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-07-21 09:54:10,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 09:54:10,405 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:54:10,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 09:54:10,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:10,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 09:54:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:54:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1290540974, now seen corresponding path program 1 times [2022-07-21 09:54:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:54:10,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059255023] [2022-07-21 09:54:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:10,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:54:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:13,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 09:54:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 09:54:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:17,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 09:54:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 09:54:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 09:54:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 09:54:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 09:54:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:26,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-21 09:54:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-21 09:54:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-21 09:54:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:30,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-21 09:54:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:32,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:32,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:33,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-07-21 09:54:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-07-21 09:54:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2022-07-21 09:54:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-21 09:54:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 09:54:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:40,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:40,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-21 09:54:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:40,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 09:54:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 09:54:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 09:54:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2022-07-21 09:54:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2022-07-21 09:54:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2022-07-21 09:54:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2022-07-21 09:54:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:54:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4024 backedges. 476 proven. 1497 refuted. 0 times theorem prover too weak. 2051 trivial. 0 not checked. [2022-07-21 09:54:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:54:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059255023] [2022-07-21 09:54:41,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059255023] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:54:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828072130] [2022-07-21 09:54:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:54:41,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:54:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:54:41,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:54:41,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 09:55:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:55:22,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 5578 conjuncts, 774 conjunts are in the unsatisfiable core [2022-07-21 09:55:23,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:55:23,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:23,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:23,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:23,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 09:55:23,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:55:23,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:55:23,687 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 09:55:23,687 INFO L390 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 28 treesize of output 22 [2022-07-21 09:55:23,948 INFO L390 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 12 treesize of output 9 [2022-07-21 09:55:26,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:26,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:26,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:26,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:26,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:26,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:26,207 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 09:55:26,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 25 [2022-07-21 09:55:26,426 INFO L390 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 12 treesize of output 9 [2022-07-21 09:55:27,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:27,670 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-21 09:55:27,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 32 [2022-07-21 09:55:27,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:55:27,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:55:27,697 INFO L390 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 12 treesize of output 9 [2022-07-21 09:55:30,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:30,695 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-07-21 09:55:30,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 143 treesize of output 145 [2022-07-21 09:55:30,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:55:30,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:55:33,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,431 INFO L356 Elim1Store]: treesize reduction 573, result has 16.7 percent of original size [2022-07-21 09:55:33,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 121 treesize of output 197 [2022-07-21 09:55:33,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:55:33,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:33,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:55:34,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2022-07-21 09:55:34,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:55:34,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:55:34,470 INFO L390 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 12 treesize of output 9 [2022-07-21 09:55:36,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:36,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:36,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:36,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 09:55:37,146 INFO L390 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 12 treesize of output 9 [2022-07-21 09:55:38,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:38,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:38,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:38,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:38,967 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:55:38,967 INFO L390 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 15 treesize of output 11 [2022-07-21 09:55:38,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:55:38,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:55:39,010 INFO L390 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 12 treesize of output 9 [2022-07-21 09:55:43,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:43,608 INFO L356 Elim1Store]: treesize reduction 101, result has 24.1 percent of original size [2022-07-21 09:55:43,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 63 [2022-07-21 09:55:43,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 treesize of output 5 [2022-07-21 09:55:43,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 treesize of output 5 [2022-07-21 09:55:47,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:55:47,888 INFO L356 Elim1Store]: treesize reduction 601, result has 19.7 percent of original size [2022-07-21 09:55:47,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 25 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 83 treesize of output 193 [2022-07-21 09:55:47,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:55:47,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:55:52,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:55:52,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:55:52,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2022-07-21 09:55:53,117 INFO L390 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 12 treesize of output 9 [2022-07-21 09:56:01,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:01,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:01,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:01,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 09:56:01,181 INFO L390 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 12 treesize of output 9 [2022-07-21 09:56:05,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:05,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:05,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:05,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:05,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:05,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:05,059 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:56:05,059 INFO L390 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 15 treesize of output 11 [2022-07-21 09:56:05,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:56:05,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:56:06,002 INFO L390 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 12 treesize of output 9 [2022-07-21 09:56:18,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:18,992 INFO L356 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2022-07-21 09:56:18,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 52 [2022-07-21 09:56:19,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:56:19,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:56:27,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:56:28,256 INFO L356 Elim1Store]: treesize reduction 784, result has 20.2 percent of original size [2022-07-21 09:56:28,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 52 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 41 case distinctions, treesize of input 126 treesize of output 275 [2022-07-21 09:56:28,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 19 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:56:28,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 19 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 09:56:46,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:56:46,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2022-07-21 09:56:46,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-21 09:56:48,129 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:56:48,129 INFO L390 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 23 treesize of output 19 [2022-07-21 09:56:48,154 INFO L390 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 12 treesize of output 9 [2022-07-21 09:57:01,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:01,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:01,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:01,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:01,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:01,770 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 09:57:01,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-07-21 09:57:01,795 INFO L390 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 12 treesize of output 9 [2022-07-21 09:57:11,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:57:11,461 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 09:57:11,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2022-07-21 09:57:11,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:57:11,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 09:57:11,500 INFO L390 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 12 treesize of output 9