./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 eb692b52 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-?-eb692b5 [2022-07-19 22:20:52,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:20:52,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:20:52,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:20:52,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:20:52,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:20:52,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:20:52,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:20:52,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:20:52,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:20:52,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:20:52,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:20:52,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:20:52,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:20:52,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:20:52,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:20:52,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:20:52,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:20:52,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:20:52,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:20:52,995 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:20:52,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:20:52,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:20:52,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:20:53,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:20:53,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:20:53,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:20:53,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:20:53,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:20:53,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:20:53,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:20:53,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:20:53,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:20:53,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:20:53,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:20:53,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:20:53,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:20:53,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:20:53,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:20:53,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:20:53,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:20:53,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:20:53,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:20:53,049 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:20:53,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:20:53,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:20:53,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:20:53,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:20:53,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:20:53,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:20:53,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:20:53,052 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:20:53,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:20:53,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:20:53,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:20:53,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:20:53,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:20:53,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:20:53,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:20:53,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:20:53,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:20:53,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:20:53,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:20:53,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:20:53,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:20:53,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:20:53,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:20:53,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:20:53,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:20:53,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:20:53,057 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:20:53,057 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:20:53,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:20:53,057 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-19 22:20:53,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:20:53,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:20:53,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:20:53,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:20:53,378 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:20:53,380 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-19 22:20:53,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6a71457/9cb96aff61c14b12a13583535529ed11/FLAGd2abccae6 [2022-07-19 22:20:54,083 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:20:54,084 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-19 22:20:54,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6a71457/9cb96aff61c14b12a13583535529ed11/FLAGd2abccae6 [2022-07-19 22:20:54,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6a71457/9cb96aff61c14b12a13583535529ed11 [2022-07-19 22:20:54,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:20:54,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:20:54,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:20:54,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:20:54,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:20:54,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:20:54" (1/1) ... [2022-07-19 22:20:54,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4608377f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:54, skipping insertion in model container [2022-07-19 22:20:54,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:20:54" (1/1) ... [2022-07-19 22:20:54,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:20:54,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:20:55,593 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-19 22:20:55,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:20:55,655 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:20:55,996 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-19 22:20:56,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:20:56,091 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:20:56,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56 WrapperNode [2022-07-19 22:20:56,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:20:56,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:20:56,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:20:56,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:20:56,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,319 INFO L137 Inliner]: procedures = 236, calls = 1201, calls flagged for inlining = 124, calls inlined = 121, statements flattened = 3745 [2022-07-19 22:20:56,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:20:56,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:20:56,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:20:56,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:20:56,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:20:56,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:20:56,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:20:56,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:20:56,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (1/1) ... [2022-07-19 22:20:56,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:20:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:20:56,580 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-19 22:20:56,603 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-19 22:20:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2022-07-19 22:20:56,628 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2022-07-19 22:20:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 22:20:56,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:20:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure vfs_fsync [2022-07-19 22:20:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure vfs_fsync [2022-07-19 22:20:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-19 22:20:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-19 22:20:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-19 22:20:56,629 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-19 22:20:56,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 22:20:56,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 22:20:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure add_disk [2022-07-19 22:20:56,630 INFO L138 BoogieDeclarations]: Found implementation of procedure add_disk [2022-07-19 22:20:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_uevent [2022-07-19 22:20:56,630 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_uevent [2022-07-19 22:20:56,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-19 22:20:56,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-19 22:20:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_xor [2022-07-19 22:20:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_xor [2022-07-19 22:20:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure invalidate_bdev [2022-07-19 22:20:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure invalidate_bdev [2022-07-19 22:20:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-19 22:20:56,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-19 22:20:56,631 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-19 22:20:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-19 22:20:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure huge_encode_dev [2022-07-19 22:20:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure huge_encode_dev [2022-07-19 22:20:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure lo_do_transfer [2022-07-19 22:20:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_do_transfer [2022-07-19 22:20:56,632 INFO L130 BoogieDeclarations]: Found specification of procedure loop_sysfs_exit [2022-07-19 22:20:56,632 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_sysfs_exit [2022-07-19 22:20:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-19 22:20:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-19 22:20:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_should_stop [2022-07-19 22:20:56,633 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_should_stop [2022-07-19 22:20:56,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 22:20:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 22:20:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure loop_alloc [2022-07-19 22:20:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_alloc [2022-07-19 22:20:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure loop_make_request [2022-07-19 22:20:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_make_request [2022-07-19 22:20:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure __do_lo_send_write [2022-07-19 22:20:56,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_lo_send_write [2022-07-19 22:20:56,634 INFO L130 BoogieDeclarations]: Found specification of procedure loop_get_status [2022-07-19 22:20:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_get_status [2022-07-19 22:20:56,635 INFO L130 BoogieDeclarations]: Found specification of procedure loop_clr_fd [2022-07-19 22:20:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_clr_fd [2022-07-19 22:20:56,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:20:56,635 INFO L130 BoogieDeclarations]: Found specification of procedure figure_loop_size [2022-07-19 22:20:56,635 INFO L138 BoogieDeclarations]: Found implementation of procedure figure_loop_size [2022-07-19 22:20:56,636 INFO L130 BoogieDeclarations]: Found specification of procedure ioctl_by_bdev [2022-07-19 22:20:56,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ioctl_by_bdev [2022-07-19 22:20:56,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:20:56,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-19 22:20:56,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-19 22:20:56,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:20:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:20:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 22:20:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 22:20:56,638 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-19 22:20:56,638 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-19 22:20:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure fput [2022-07-19 22:20:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure fput [2022-07-19 22:20:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-19 22:20:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-19 22:20:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_capacity [2022-07-19 22:20:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_capacity [2022-07-19 22:20:56,639 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_empty [2022-07-19 22:20:56,639 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_empty [2022-07-19 22:20:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 22:20:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-19 22:20:56,640 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-19 22:20:56,640 INFO L130 BoogieDeclarations]: Found specification of procedure loop_free [2022-07-19 22:20:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_free [2022-07-19 22:20:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_none [2022-07-19 22:20:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_none [2022-07-19 22:20:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 22:20:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure bd_set_size [2022-07-19 22:20:56,641 INFO L138 BoogieDeclarations]: Found implementation of procedure bd_set_size [2022-07-19 22:20:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:20:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure fget [2022-07-19 22:20:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure fget [2022-07-19 22:20:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_set_gfp_mask [2022-07-19 22:20:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_set_gfp_mask [2022-07-19 22:20:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure xor_init [2022-07-19 22:20:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure xor_init [2022-07-19 22:20:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure kmap [2022-07-19 22:20:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap [2022-07-19 22:20:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 22:20:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 22:20:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 22:20:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 22:20:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-19 22:20:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-19 22:20:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-19 22:20:56,645 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-19 22:20:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:20:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-19 22:20:56,645 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-19 22:20:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure __kmap_atomic [2022-07-19 22:20:56,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmap_atomic [2022-07-19 22:20:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-19 22:20:56,646 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-19 22:20:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:20:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-19 22:20:56,646 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-19 22:20:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:20:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure get_loop_size [2022-07-19 22:20:56,647 INFO L138 BoogieDeclarations]: Found implementation of procedure get_loop_size [2022-07-19 22:20:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:20:56,647 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-19 22:20:56,648 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-19 22:20:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_status [2022-07-19 22:20:56,648 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_status [2022-07-19 22:20:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-19 22:20:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure lo_ioctl [2022-07-19 22:20:56,649 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_ioctl [2022-07-19 22:20:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-19 22:20:56,651 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-19 22:20:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-19 22:20:56,651 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-19 22:20:56,651 INFO L130 BoogieDeclarations]: Found specification of procedure loop_release_xfer [2022-07-19 22:20:56,653 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_release_xfer [2022-07-19 22:20:56,653 INFO L130 BoogieDeclarations]: Found specification of procedure _cond_resched [2022-07-19 22:20:56,653 INFO L138 BoogieDeclarations]: Found implementation of procedure _cond_resched [2022-07-19 22:20:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure kunmap [2022-07-19 22:20:56,654 INFO L138 BoogieDeclarations]: Found implementation of procedure kunmap [2022-07-19 22:20:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-19 22:20:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-19 22:20:56,659 INFO L130 BoogieDeclarations]: Found specification of procedure loop_switch [2022-07-19 22:20:56,659 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_switch [2022-07-19 22:20:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_gfp_mask [2022-07-19 22:20:56,660 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_gfp_mask [2022-07-19 22:20:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:20:56,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:20:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-19 22:20:56,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-19 22:20:56,660 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2022-07-19 22:20:56,660 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2022-07-19 22:20:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:20:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:20:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:20:56,661 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-19 22:20:56,661 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-19 22:20:57,281 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:20:57,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:20:58,040 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:20:59,124 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-07-19 22:20:59,124 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-07-19 22:20:59,143 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-19 22:20:59,143 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-19 22:20:59,560 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-19 22:20:59,560 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-19 22:20:59,931 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:20:59,933 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:01,108 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##72: assume !false; [2022-07-19 22:21:01,109 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume false; [2022-07-19 22:21:01,109 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-19 22:21:01,109 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-19 22:21:01,155 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:21:01,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:21:01,169 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 22:21:01,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:21:01 BoogieIcfgContainer [2022-07-19 22:21:01,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:21:01,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:21:01,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:21:01,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:21:01,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:20:54" (1/3) ... [2022-07-19 22:21:01,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b88f47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:21:01, skipping insertion in model container [2022-07-19 22:21:01,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:20:56" (2/3) ... [2022-07-19 22:21:01,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b88f47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:21:01, skipping insertion in model container [2022-07-19 22:21:01,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:21:01" (3/3) ... [2022-07-19 22:21:01,180 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-19 22:21:01,193 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:21:01,194 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:21:01,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:21:01,259 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@41ba5c59, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a8f120a [2022-07-19 22:21:01,259 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:21:01,266 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-19 22:21:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 22:21:01,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:01,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:01,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1638152850, now seen corresponding path program 1 times [2022-07-19 22:21:01,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:01,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715238576] [2022-07-19 22:21:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:01,648 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-19 22:21:01,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:01,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715238576] [2022-07-19 22:21:01,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715238576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:01,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:01,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:21:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193324541] [2022-07-19 22:21:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:01,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:21:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:21:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:21:01,684 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-19 22:21:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:01,962 INFO L93 Difference]: Finished difference Result 3311 states and 4739 transitions. [2022-07-19 22:21:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:21:01,964 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-19 22:21:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:01,991 INFO L225 Difference]: With dead ends: 3311 [2022-07-19 22:21:01,991 INFO L226 Difference]: Without dead ends: 2166 [2022-07-19 22:21:02,003 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-19 22:21:02,005 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.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:02,006 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.0s Time] [2022-07-19 22:21:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2022-07-19 22:21:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2163. [2022-07-19 22:21:02,150 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-19 22:21:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2986 transitions. [2022-07-19 22:21:02,167 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2986 transitions. Word has length 11 [2022-07-19 22:21:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:02,167 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2986 transitions. [2022-07-19 22:21:02,168 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-19 22:21:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2986 transitions. [2022-07-19 22:21:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 22:21:02,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:02,178 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-19 22:21:02,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:21:02,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:02,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash -780115607, now seen corresponding path program 1 times [2022-07-19 22:21:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:02,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600542561] [2022-07-19 22:21:02,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 22:21:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:02,309 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-19 22:21:02,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:02,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600542561] [2022-07-19 22:21:02,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600542561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:02,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:02,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:21:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361805443] [2022-07-19 22:21:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:02,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:21:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:21:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:21:02,313 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-19 22:21:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:04,237 INFO L93 Difference]: Finished difference Result 4691 states and 6565 transitions. [2022-07-19 22:21:04,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:21:04,238 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-19 22:21:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:04,256 INFO L225 Difference]: With dead ends: 4691 [2022-07-19 22:21:04,257 INFO L226 Difference]: Without dead ends: 2609 [2022-07-19 22:21:04,265 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-19 22:21:04,269 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 565 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:04,271 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.8s Time] [2022-07-19 22:21:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-19 22:21:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-19 22:21:04,354 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-19 22:21:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2984 transitions. [2022-07-19 22:21:04,365 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2984 transitions. Word has length 46 [2022-07-19 22:21:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:04,366 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2984 transitions. [2022-07-19 22:21:04,366 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-19 22:21:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2984 transitions. [2022-07-19 22:21:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 22:21:04,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:04,369 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-19 22:21:04,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:21:04,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash -800617350, now seen corresponding path program 1 times [2022-07-19 22:21:04,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:04,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81181592] [2022-07-19 22:21:04,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:21:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:21:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:04,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:04,502 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-19 22:21:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:04,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81181592] [2022-07-19 22:21:04,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81181592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:04,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:04,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:21:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545185027] [2022-07-19 22:21:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:04,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:21:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:21:04,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:21:04,505 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-19 22:21:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:05,830 INFO L93 Difference]: Finished difference Result 4764 states and 6650 transitions. [2022-07-19 22:21:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:21:05,831 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-19 22:21:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:05,845 INFO L225 Difference]: With dead ends: 4764 [2022-07-19 22:21:05,846 INFO L226 Difference]: Without dead ends: 2609 [2022-07-19 22:21:05,854 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-19 22:21:05,857 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 2078 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:05,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2231 Valid, 2196 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 22:21:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-19 22:21:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-19 22:21:05,958 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-19 22:21:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2982 transitions. [2022-07-19 22:21:05,975 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2982 transitions. Word has length 58 [2022-07-19 22:21:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:05,975 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2982 transitions. [2022-07-19 22:21:05,975 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-19 22:21:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2982 transitions. [2022-07-19 22:21:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 22:21:05,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:05,979 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-19 22:21:05,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:21:05,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash -973306474, now seen corresponding path program 1 times [2022-07-19 22:21:05,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:05,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360067453] [2022-07-19 22:21:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 22:21:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 22:21:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:06,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:06,096 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-19 22:21:06,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:06,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360067453] [2022-07-19 22:21:06,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360067453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:06,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:06,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:21:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060678857] [2022-07-19 22:21:06,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:06,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:21:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:06,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:21:06,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:21:06,102 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-19 22:21:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:07,980 INFO L93 Difference]: Finished difference Result 4691 states and 6560 transitions. [2022-07-19 22:21:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:21:07,981 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-19 22:21:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:07,996 INFO L225 Difference]: With dead ends: 4691 [2022-07-19 22:21:07,996 INFO L226 Difference]: Without dead ends: 2592 [2022-07-19 22:21:08,027 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-19 22:21:08,033 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 565 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:08,034 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.7s Time] [2022-07-19 22:21:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-07-19 22:21:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2146. [2022-07-19 22:21:08,101 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-19 22:21:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2960 transitions. [2022-07-19 22:21:08,111 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2960 transitions. Word has length 51 [2022-07-19 22:21:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:08,112 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 2960 transitions. [2022-07-19 22:21:08,112 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-19 22:21:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2960 transitions. [2022-07-19 22:21:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:21:08,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:08,118 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-19 22:21:08,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:21:08,119 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash 966613706, now seen corresponding path program 1 times [2022-07-19 22:21:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:08,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528857650] [2022-07-19 22:21:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:08,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:21:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:08,261 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-19 22:21:08,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:08,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528857650] [2022-07-19 22:21:08,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528857650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:08,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:08,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:21:08,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650083461] [2022-07-19 22:21:08,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:08,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:21:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:21:08,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:21:08,267 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-19 22:21:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:09,770 INFO L93 Difference]: Finished difference Result 4690 states and 6558 transitions. [2022-07-19 22:21:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:21:09,770 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-19 22:21:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:09,783 INFO L225 Difference]: With dead ends: 4690 [2022-07-19 22:21:09,784 INFO L226 Difference]: Without dead ends: 2598 [2022-07-19 22:21:09,791 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-19 22:21:09,792 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 738 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:09,793 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.4s Time] [2022-07-19 22:21:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2022-07-19 22:21:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2147. [2022-07-19 22:21:09,886 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-19 22:21:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2961 transitions. [2022-07-19 22:21:09,895 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2961 transitions. Word has length 63 [2022-07-19 22:21:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:09,897 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 2961 transitions. [2022-07-19 22:21:09,897 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-19 22:21:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2961 transitions. [2022-07-19 22:21:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 22:21:09,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:09,900 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-19 22:21:09,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:21:09,901 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:09,901 INFO L85 PathProgramCache]: Analyzing trace with hash 707532724, now seen corresponding path program 1 times [2022-07-19 22:21:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:09,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827536312] [2022-07-19 22:21:09,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:09,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:21:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:21:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,165 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-19 22:21:10,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:10,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827536312] [2022-07-19 22:21:10,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827536312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:10,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392428257] [2022-07-19 22:21:10,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:10,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:10,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:10,168 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-19 22:21:10,172 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-19 22:21:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:10,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 22:21:10,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:10,798 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-19 22:21:10,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:21:10,885 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-19 22:21:10,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392428257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:21:10,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:21:10,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-07-19 22:21:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353805402] [2022-07-19 22:21:10,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:21:10,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:21:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:21:10,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:21:10,888 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-19 22:21:15,194 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-19 22:21:17,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:21:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:18,609 INFO L93 Difference]: Finished difference Result 4887 states and 6970 transitions. [2022-07-19 22:21:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:21:18,610 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-19 22:21:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:18,625 INFO L225 Difference]: With dead ends: 4887 [2022-07-19 22:21:18,625 INFO L226 Difference]: Without dead ends: 2795 [2022-07-19 22:21:18,632 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-19 22:21:18,633 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 1002 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 421 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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, 7.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:18,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 5689 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2770 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-07-19 22:21:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2022-07-19 22:21:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2165. [2022-07-19 22:21:18,724 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-19 22:21:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 2985 transitions. [2022-07-19 22:21:18,733 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 2985 transitions. Word has length 87 [2022-07-19 22:21:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:18,733 INFO L495 AbstractCegarLoop]: Abstraction has 2165 states and 2985 transitions. [2022-07-19 22:21:18,733 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-19 22:21:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2985 transitions. [2022-07-19 22:21:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-19 22:21:18,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:18,736 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-19 22:21:18,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 22:21:18,963 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-19 22:21:18,963 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:18,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2065381788, now seen corresponding path program 1 times [2022-07-19 22:21:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:18,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97983427] [2022-07-19 22:21:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:21:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:21:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:21:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:21:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:21:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:21:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 22:21:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:19,387 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-19 22:21:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97983427] [2022-07-19 22:21:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97983427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:19,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83450941] [2022-07-19 22:21:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:19,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:19,389 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-19 22:21:19,391 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-19 22:21:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:20,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 1827 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 22:21:20,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:20,195 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-19 22:21:20,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:21:20,382 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-19 22:21:20,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83450941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:21:20,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:21:20,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2022-07-19 22:21:20,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387183283] [2022-07-19 22:21:20,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:21:20,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 22:21:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:20,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 22:21:20,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:21:20,385 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-19 22:21:24,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:21:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:28,183 INFO L93 Difference]: Finished difference Result 4911 states and 7003 transitions. [2022-07-19 22:21:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:21:28,188 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-19 22:21:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:28,206 INFO L225 Difference]: With dead ends: 4911 [2022-07-19 22:21:28,207 INFO L226 Difference]: Without dead ends: 2819 [2022-07-19 22:21:28,215 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-19 22:21:28,216 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 1069 mSDsluCounter, 7468 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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, 7.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:28,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 8880 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 4697 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-19 22:21:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2022-07-19 22:21:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2189. [2022-07-19 22:21:28,314 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-19 22:21:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3017 transitions. [2022-07-19 22:21:28,323 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3017 transitions. Word has length 152 [2022-07-19 22:21:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:28,323 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 3017 transitions. [2022-07-19 22:21:28,324 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-19 22:21:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3017 transitions. [2022-07-19 22:21:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-19 22:21:28,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:28,328 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-19 22:21:28,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 22:21:28,543 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-19 22:21:28,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1776723700, now seen corresponding path program 2 times [2022-07-19 22:21:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:28,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768821384] [2022-07-19 22:21:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:21:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:21:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:21:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:21:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:21:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:21:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:21:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:21:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:21:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:21:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 22:21:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 22:21:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:21:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 22:21:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 22:21:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:29,131 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-19 22:21:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:29,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768821384] [2022-07-19 22:21:29,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768821384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:29,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982677148] [2022-07-19 22:21:29,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:21:29,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:29,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:29,134 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-19 22:21:29,136 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-19 22:21:29,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 22:21:29,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:21:29,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-19 22:21:29,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:29,888 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-19 22:21:29,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:21:29,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982677148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:29,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:21:29,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-19 22:21:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341105158] [2022-07-19 22:21:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:29,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:21:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:21:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:21:29,891 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-19 22:21:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:31,331 INFO L93 Difference]: Finished difference Result 5268 states and 7285 transitions. [2022-07-19 22:21:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:21:31,331 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-19 22:21:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:31,352 INFO L225 Difference]: With dead ends: 5268 [2022-07-19 22:21:31,353 INFO L226 Difference]: Without dead ends: 4209 [2022-07-19 22:21:31,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:21:31,360 INFO L413 NwaCegarLoop]: 2816 mSDtfsCounter, 1662 mSDsluCounter, 12218 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:31,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 15034 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 22:21:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4209 states. [2022-07-19 22:21:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4209 to 4155. [2022-07-19 22:21:31,548 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-19 22:21:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5743 transitions. [2022-07-19 22:21:31,565 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5743 transitions. Word has length 248 [2022-07-19 22:21:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:31,566 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 5743 transitions. [2022-07-19 22:21:31,567 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-19 22:21:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5743 transitions. [2022-07-19 22:21:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-19 22:21:31,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:31,572 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-19 22:21:31,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:21:31,787 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-19 22:21:31,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1557868982, now seen corresponding path program 1 times [2022-07-19 22:21:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579589863] [2022-07-19 22:21:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:21:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:21:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:21:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:21:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:21:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:21:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:21:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:21:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:21:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:21:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 22:21:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 22:21:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:21:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 22:21:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 22:21:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,310 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-19 22:21:32,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:32,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579589863] [2022-07-19 22:21:32,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579589863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:32,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:32,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:21:32,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507133960] [2022-07-19 22:21:32,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:21:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:32,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:21:32,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:21:32,313 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-19 22:21:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:39,109 INFO L93 Difference]: Finished difference Result 8065 states and 11861 transitions. [2022-07-19 22:21:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:21:39,110 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-19 22:21:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:39,150 INFO L225 Difference]: With dead ends: 8065 [2022-07-19 22:21:39,150 INFO L226 Difference]: Without dead ends: 8062 [2022-07-19 22:21:39,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:21:39,156 INFO L413 NwaCegarLoop]: 2910 mSDtfsCounter, 5886 mSDsluCounter, 3326 mSDsCounter, 0 mSdLazyCounter, 3778 mSolverCounterSat, 2546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 6236 SdHoareTripleChecker+Invalid, 6324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2546 IncrementalHoareTripleChecker+Valid, 3778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:39,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 6236 Invalid, 6324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2546 Valid, 3778 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-19 22:21:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-07-19 22:21:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 6361. [2022-07-19 22:21:39,487 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-19 22:21:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 8876 transitions. [2022-07-19 22:21:39,514 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 8876 transitions. Word has length 248 [2022-07-19 22:21:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:39,515 INFO L495 AbstractCegarLoop]: Abstraction has 6361 states and 8876 transitions. [2022-07-19 22:21:39,515 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-19 22:21:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 8876 transitions. [2022-07-19 22:21:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-07-19 22:21:39,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:39,521 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-19 22:21:39,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:21:39,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:39,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1635323117, now seen corresponding path program 1 times [2022-07-19 22:21:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:39,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542802239] [2022-07-19 22:21:39,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:21:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:21:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:21:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:21:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:21:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:21:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:21:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:21:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:21:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:21:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 22:21:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 22:21:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:21:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-19 22:21:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-19 22:21:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-19 22:21:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,956 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-19 22:21:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:39,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542802239] [2022-07-19 22:21:39,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542802239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:39,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:39,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:21:39,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807788945] [2022-07-19 22:21:39,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:39,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:21:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:39,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:21:39,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:21:39,959 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-19 22:21:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:42,497 INFO L93 Difference]: Finished difference Result 14925 states and 21806 transitions. [2022-07-19 22:21:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:21:42,498 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-19 22:21:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:42,541 INFO L225 Difference]: With dead ends: 14925 [2022-07-19 22:21:42,542 INFO L226 Difference]: Without dead ends: 8671 [2022-07-19 22:21:42,566 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-19 22:21:42,567 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 1201 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:42,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 3259 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 22:21:42,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8671 states. [2022-07-19 22:21:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8671 to 7004. [2022-07-19 22:21:42,895 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-19 22:21:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 9933 transitions. [2022-07-19 22:21:43,006 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 9933 transitions. Word has length 254 [2022-07-19 22:21:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:43,007 INFO L495 AbstractCegarLoop]: Abstraction has 7004 states and 9933 transitions. [2022-07-19 22:21:43,007 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-19 22:21:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 9933 transitions. [2022-07-19 22:21:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-19 22:21:43,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:43,012 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-19 22:21:43,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 22:21:43,013 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1210188346, now seen corresponding path program 1 times [2022-07-19 22:21:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:43,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62344729] [2022-07-19 22:21:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:21:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:21:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 22:21:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:21:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:21:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:21:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:21:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:21:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:21:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:21:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 22:21:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 22:21:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 22:21:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 22:21:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-19 22:21:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-19 22:21:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:43,377 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-19 22:21:43,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:43,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62344729] [2022-07-19 22:21:43,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62344729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:43,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602102310] [2022-07-19 22:21:43,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:43,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:43,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:43,380 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-19 22:21:43,403 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-19 22:21:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:44,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-19 22:21:44,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:44,298 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-19 22:21:44,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:21:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602102310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:44,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:21:44,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-19 22:21:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579728614] [2022-07-19 22:21:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:44,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:21:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:21:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:21:44,301 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-19 22:21:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:44,685 INFO L93 Difference]: Finished difference Result 14011 states and 19874 transitions. [2022-07-19 22:21:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:21:44,686 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-19 22:21:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:44,717 INFO L225 Difference]: With dead ends: 14011 [2022-07-19 22:21:44,718 INFO L226 Difference]: Without dead ends: 6993 [2022-07-19 22:21:44,743 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-19 22:21:44,745 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-19 22:21:44,745 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-19 22:21:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6993 states. [2022-07-19 22:21:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6993 to 6993. [2022-07-19 22:21:45,036 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-19 22:21:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 9919 transitions. [2022-07-19 22:21:45,069 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 9919 transitions. Word has length 256 [2022-07-19 22:21:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:45,070 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 9919 transitions. [2022-07-19 22:21:45,070 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-19 22:21:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 9919 transitions. [2022-07-19 22:21:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-07-19 22:21:45,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:45,078 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-19 22:21:45,112 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-19 22:21:45,291 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-19 22:21:45,291 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:45,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1841619178, now seen corresponding path program 1 times [2022-07-19 22:21:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:45,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929033119] [2022-07-19 22:21:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:21:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 22:21:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:45,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:21:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:21:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 22:21:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 22:21:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-19 22:21:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-19 22:21:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-19 22:21:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-19 22:21:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-19 22:21:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-19 22:21:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-19 22:21:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-07-19 22:21:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:21:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-19 22:21:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-07-19 22:21:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-19 22:21:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-19 22:21:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,308 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-19 22:21:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:46,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929033119] [2022-07-19 22:21:46,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929033119] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:46,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649320794] [2022-07-19 22:21:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:46,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:46,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:46,311 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-19 22:21:46,335 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-19 22:21:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:48,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 4690 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 22:21:48,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:48,095 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-19 22:21:48,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:21:48,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649320794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:48,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:21:48,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2022-07-19 22:21:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658393557] [2022-07-19 22:21:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:48,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:21:48,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:48,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:21:48,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:21:48,101 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-19 22:21:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:48,463 INFO L93 Difference]: Finished difference Result 13986 states and 19859 transitions. [2022-07-19 22:21:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:21:48,464 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-19 22:21:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:48,495 INFO L225 Difference]: With dead ends: 13986 [2022-07-19 22:21:48,496 INFO L226 Difference]: Without dead ends: 7001 [2022-07-19 22:21:48,519 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-19 22:21:48,520 INFO L413 NwaCegarLoop]: 1517 mSDtfsCounter, 6 mSDsluCounter, 9082 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 22:21:48,520 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-19 22:21:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2022-07-19 22:21:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 6995. [2022-07-19 22:21:48,813 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-19 22:21:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9926 transitions. [2022-07-19 22:21:48,843 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9926 transitions. Word has length 440 [2022-07-19 22:21:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:48,844 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9926 transitions. [2022-07-19 22:21:48,844 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-19 22:21:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9926 transitions. [2022-07-19 22:21:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2022-07-19 22:21:48,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:48,855 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-19 22:21:48,894 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-19 22:21:49,083 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-19 22:21:49,083 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash -969582626, now seen corresponding path program 1 times [2022-07-19 22:21:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:49,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179319537] [2022-07-19 22:21:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:21:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 22:21:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:21:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:21:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:21:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:21:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 22:21:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 22:21:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-19 22:21:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-19 22:21:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-19 22:21:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-19 22:21:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:49,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-19 22:21:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-07-19 22:21:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2022-07-19 22:21:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:21:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:21:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 22:21:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 22:21:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-07-19 22:21:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-19 22:21:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2022-07-19 22:21:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2022-07-19 22:21:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:50,115 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-19 22:21:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:50,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179319537] [2022-07-19 22:21:50,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179319537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:50,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653753127] [2022-07-19 22:21:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:50,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:50,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:50,117 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-19 22:21:50,119 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-19 22:21:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:53,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 4986 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-19 22:21:53,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:53,312 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-19 22:21:53,417 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-19 22:21:53,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:21:53,880 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-19 22:21:53,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653753127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:21:53,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:21:53,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 6] total 22 [2022-07-19 22:21:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498674412] [2022-07-19 22:21:53,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:21:53,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 22:21:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:53,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 22:21:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:21:53,885 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-19 22:22:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:22:03,618 INFO L93 Difference]: Finished difference Result 15645 states and 22950 transitions. [2022-07-19 22:22:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:22:03,619 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-19 22:22:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:22:03,666 INFO L225 Difference]: With dead ends: 15645 [2022-07-19 22:22:03,666 INFO L226 Difference]: Without dead ends: 8657 [2022-07-19 22:22:03,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1095 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 22:22:03,694 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 703 mSDsluCounter, 15147 mSDsCounter, 0 mSdLazyCounter, 9490 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s 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, 9.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:22:03,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 16532 Invalid, 9837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 9490 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-07-19 22:22:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2022-07-19 22:22:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 6995. [2022-07-19 22:22:04,038 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-19 22:22:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9924 transitions. [2022-07-19 22:22:04,070 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9924 transitions. Word has length 496 [2022-07-19 22:22:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:22:04,070 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9924 transitions. [2022-07-19 22:22:04,070 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-19 22:22:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9924 transitions. [2022-07-19 22:22:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-07-19 22:22:04,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:22:04,130 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-19 22:22:04,171 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-19 22:22:04,331 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-19 22:22:04,331 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:22:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:22:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1290540974, now seen corresponding path program 1 times [2022-07-19 22:22:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:22:04,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708721867] [2022-07-19 22:22:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:22:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:22:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:12,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:12,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:13,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:13,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:22:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:13,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 22:22:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:22:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:22:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-19 22:22:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-19 22:22:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:24,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:24,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-19 22:22:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-19 22:22:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-19 22:22:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:29,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-19 22:22:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-07-19 22:22:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-07-19 22:22:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2022-07-19 22:22:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:36,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-19 22:22:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 22:22:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:22:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:22:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2022-07-19 22:22:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2022-07-19 22:22:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2022-07-19 22:22:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2022-07-19 22:22:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:42,636 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-19 22:22:42,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:22:42,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708721867] [2022-07-19 22:22:42,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708721867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:42,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366560736] [2022-07-19 22:22:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:42,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:22:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:22:42,640 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-19 22:22:42,646 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-19 22:23:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:32,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 5578 conjuncts, 774 conjunts are in the unsatisfiable core [2022-07-19 22:23:32,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:32,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:32,166 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-19 22:23:32,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:32,172 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-19 22:23:32,436 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-19 22:23:32,446 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-19 22:23:33,007 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 22:23:33,008 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-19 22:23:33,363 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-19 22:23:36,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:36,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:36,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:36,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:36,729 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 22:23:36,729 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-19 22:23:37,050 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-19 22:23:38,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:38,862 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-19 22:23:38,863 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-19 22:23:38,873 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-19 22:23:38,879 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-19 22:23:38,910 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-19 22:23:43,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:43,656 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-07-19 22:23:43,657 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-19 22:23:43,683 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-19 22:23:43,703 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-19 22:23:47,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:47,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:48,123 INFO L356 Elim1Store]: treesize reduction 573, result has 16.7 percent of original size [2022-07-19 22:23:48,124 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-19 22:23:48,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:48,163 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-19 22:23:48,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:48,183 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-19 22:23:49,433 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-19 22:23:49,439 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-19 22:23:49,444 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-19 22:23:50,024 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-19 22:23:54,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:54,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:54,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:54,317 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-19 22:23:54,764 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-19 22:23:57,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:57,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:57,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:57,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:57,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:57,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:57,908 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 22:23:57,908 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-19 22:23:57,922 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-19 22:23:57,930 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-19 22:23:57,961 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-19 22:24:04,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:04,703 INFO L356 Elim1Store]: treesize reduction 101, result has 24.1 percent of original size [2022-07-19 22:24:04,703 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-19 22:24:04,732 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-19 22:24:04,757 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-19 22:24:10,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:10,619 INFO L356 Elim1Store]: treesize reduction 601, result has 19.7 percent of original size [2022-07-19 22:24:10,620 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-19 22:24:10,662 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-19 22:24:10,697 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-19 22:24:14,957 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-19 22:24:14,961 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-19 22:24:14,988 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 60 treesize of output 42 [2022-07-19 22:24:16,096 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-19 22:24:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:25,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:25,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:25,181 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-19 22:24:25,206 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-19 22:24:30,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:30,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:30,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:30,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:30,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:30,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:30,971 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 22:24:30,971 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-19 22:24:30,980 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-19 22:24:30,987 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-19 22:24:31,877 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