./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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/forester-heap/dll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-13 23:25:57,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:25:57,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:25:58,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:25:58,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:25:58,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:25:58,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:25:58,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:25:58,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:25:58,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:25:58,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:25:58,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:25:58,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:25:58,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:25:58,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:25:58,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:25:58,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:25:58,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:25:58,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:25:58,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:25:58,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:25:58,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:25:58,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:25:58,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:25:58,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:25:58,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:25:58,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:25:58,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:25:58,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:25:58,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:25:58,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:25:58,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:25:58,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:25:58,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:25:58,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:25:58,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:25:58,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:25:58,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:25:58,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:25:58,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:25:58,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:25:58,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-13 23:25:58,133 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:25:58,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:25:58,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:25:58,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:25:58,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:25:58,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:25:58,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:25:58,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:25:58,135 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:25:58,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:25:58,136 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:25:58,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:25:58,138 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:25:58,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:25:58,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:25:58,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:25:58,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:25:58,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:25:58,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:25:58,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:25:58,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:25:58,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:25:58,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:25:58,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:25:58,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:25:58,140 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:25:58,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:25:58,140 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:25:58,140 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2023-02-13 23:25:58,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:25:58,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:25:58,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:25:58,365 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:25:58,366 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:25:58,367 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2023-02-13 23:25:59,481 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:25:59,715 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:25:59,716 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2023-02-13 23:25:59,725 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0e0a51a/20f5aa50be9742f4a8c71bb6c868d6eb/FLAG9794ad679 [2023-02-13 23:25:59,742 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0e0a51a/20f5aa50be9742f4a8c71bb6c868d6eb [2023-02-13 23:25:59,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:25:59,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:25:59,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:25:59,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:25:59,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:25:59,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:25:59" (1/1) ... [2023-02-13 23:25:59,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29188b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:25:59, skipping insertion in model container [2023-02-13 23:25:59,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:25:59" (1/1) ... [2023-02-13 23:25:59,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:25:59,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:26:00,052 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2023-02-13 23:26:00,059 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2023-02-13 23:26:00,062 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2023-02-13 23:26:00,062 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2023-02-13 23:26:00,064 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2023-02-13 23:26:00,065 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2023-02-13 23:26:00,068 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2023-02-13 23:26:00,069 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2023-02-13 23:26:00,070 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2023-02-13 23:26:00,070 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2023-02-13 23:26:00,072 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2023-02-13 23:26:00,072 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2023-02-13 23:26:00,073 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2023-02-13 23:26:00,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:26:00,084 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:26:00,109 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2023-02-13 23:26:00,113 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2023-02-13 23:26:00,116 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2023-02-13 23:26:00,116 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2023-02-13 23:26:00,118 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2023-02-13 23:26:00,119 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2023-02-13 23:26:00,121 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2023-02-13 23:26:00,121 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2023-02-13 23:26:00,122 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2023-02-13 23:26:00,123 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2023-02-13 23:26:00,124 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2023-02-13 23:26:00,124 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2023-02-13 23:26:00,125 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2023-02-13 23:26:00,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:26:00,149 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:26:00,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00 WrapperNode [2023-02-13 23:26:00,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:26:00,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:26:00,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:26:00,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:26:00,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,211 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2023-02-13 23:26:00,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:26:00,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:26:00,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:26:00,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:26:00,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:26:00,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:26:00,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:26:00,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:26:00,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (1/1) ... [2023-02-13 23:26:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:26:00,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:26:00,288 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) [2023-02-13 23:26:00,293 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 [2023-02-13 23:26:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-13 23:26:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:26:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-13 23:26:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-13 23:26:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-13 23:26:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:26:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:26:00,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:26:00,424 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:26:00,426 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:26:00,782 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:26:00,788 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:26:00,788 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2023-02-13 23:26:00,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:26:00 BoogieIcfgContainer [2023-02-13 23:26:00,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:26:00,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:26:00,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:26:00,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:26:00,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:25:59" (1/3) ... [2023-02-13 23:26:00,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fca6d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:26:00, skipping insertion in model container [2023-02-13 23:26:00,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:26:00" (2/3) ... [2023-02-13 23:26:00,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fca6d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:26:00, skipping insertion in model container [2023-02-13 23:26:00,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:26:00" (3/3) ... [2023-02-13 23:26:00,803 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2023-02-13 23:26:00,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:26:00,819 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-02-13 23:26:00,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:26:00,882 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b45a3f4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:26:00,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-02-13 23:26:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-13 23:26:00,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:00,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-13 23:26:00,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2023-02-13 23:26:00,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:00,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635549735] [2023-02-13 23:26:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:01,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635549735] [2023-02-13 23:26:01,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635549735] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:01,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:01,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:26:01,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382233298] [2023-02-13 23:26:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:01,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:26:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:01,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:26:01,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:01,158 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:01,215 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2023-02-13 23:26:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:26:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-13 23:26:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:01,225 INFO L225 Difference]: With dead ends: 180 [2023-02-13 23:26:01,225 INFO L226 Difference]: Without dead ends: 95 [2023-02-13 23:26:01,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:01,233 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:01,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:26:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-13 23:26:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2023-02-13 23:26:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-13 23:26:01,289 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2023-02-13 23:26:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:01,289 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-13 23:26:01,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-13 23:26:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-13 23:26:01,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:01,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:26:01,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:26:01,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2023-02-13 23:26:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635938063] [2023-02-13 23:26:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:01,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635938063] [2023-02-13 23:26:01,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635938063] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:01,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:01,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:26:01,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177193199] [2023-02-13 23:26:01,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:01,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:26:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:26:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:01,388 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:01,410 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-13 23:26:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:26:01,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-13 23:26:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:01,412 INFO L225 Difference]: With dead ends: 80 [2023-02-13 23:26:01,412 INFO L226 Difference]: Without dead ends: 78 [2023-02-13 23:26:01,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:01,414 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:01,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:26:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-13 23:26:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-13 23:26:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-13 23:26:01,428 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2023-02-13 23:26:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:01,428 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-13 23:26:01,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-13 23:26:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-13 23:26:01,429 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:01,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:26:01,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-13 23:26:01,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2023-02-13 23:26:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:01,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115051210] [2023-02-13 23:26:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:01,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115051210] [2023-02-13 23:26:01,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115051210] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:01,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:01,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:26:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119103037] [2023-02-13 23:26:01,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:01,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:26:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:26:01,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:26:01,585 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:01,661 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-13 23:26:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:26:01,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-13 23:26:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:01,663 INFO L225 Difference]: With dead ends: 80 [2023-02-13 23:26:01,663 INFO L226 Difference]: Without dead ends: 78 [2023-02-13 23:26:01,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:26:01,664 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:01,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-13 23:26:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-02-13 23:26:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-02-13 23:26:01,671 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2023-02-13 23:26:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:01,671 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-02-13 23:26:01,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-02-13 23:26:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-13 23:26:01,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:01,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:26:01,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-13 23:26:01,673 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2023-02-13 23:26:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:01,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529959264] [2023-02-13 23:26:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:02,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529959264] [2023-02-13 23:26:02,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529959264] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:02,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:26:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470882348] [2023-02-13 23:26:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:02,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:26:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:26:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:26:02,006 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:02,119 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2023-02-13 23:26:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:26:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-13 23:26:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:02,123 INFO L225 Difference]: With dead ends: 195 [2023-02-13 23:26:02,123 INFO L226 Difference]: Without dead ends: 128 [2023-02-13 23:26:02,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:26:02,126 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:02,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-13 23:26:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2023-02-13 23:26:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.303030303030303) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-13 23:26:02,142 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2023-02-13 23:26:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:02,142 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-13 23:26:02,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-13 23:26:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-13 23:26:02,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:02,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:26:02,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-13 23:26:02,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:02,144 INFO L85 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2023-02-13 23:26:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789908723] [2023-02-13 23:26:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:02,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:02,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789908723] [2023-02-13 23:26:02,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789908723] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:02,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:02,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:26:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735149613] [2023-02-13 23:26:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:02,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:26:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:26:02,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:26:02,369 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:02,485 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2023-02-13 23:26:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:26:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-13 23:26:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:02,487 INFO L225 Difference]: With dead ends: 122 [2023-02-13 23:26:02,488 INFO L226 Difference]: Without dead ends: 118 [2023-02-13 23:26:02,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:26:02,489 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 151 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:02,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 157 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-13 23:26:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2023-02-13 23:26:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-02-13 23:26:02,502 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2023-02-13 23:26:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:02,502 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-02-13 23:26:02,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-02-13 23:26:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-13 23:26:02,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:02,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:26:02,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-13 23:26:02,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2023-02-13 23:26:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:02,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339848274] [2023-02-13 23:26:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:02,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:02,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339848274] [2023-02-13 23:26:02,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339848274] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:02,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:02,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:26:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491031540] [2023-02-13 23:26:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:02,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:26:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:26:02,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:26:02,561 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:02,630 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2023-02-13 23:26:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:26:02,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-13 23:26:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:02,631 INFO L225 Difference]: With dead ends: 132 [2023-02-13 23:26:02,631 INFO L226 Difference]: Without dead ends: 112 [2023-02-13 23:26:02,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:26:02,633 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 131 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:02,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 114 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-13 23:26:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2023-02-13 23:26:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-02-13 23:26:02,652 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2023-02-13 23:26:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:02,652 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-02-13 23:26:02,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-02-13 23:26:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-13 23:26:02,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:02,653 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] [2023-02-13 23:26:02,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-13 23:26:02,654 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2023-02-13 23:26:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:02,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21965531] [2023-02-13 23:26:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:02,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21965531] [2023-02-13 23:26:02,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21965531] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:02,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:02,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:26:02,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808879326] [2023-02-13 23:26:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:02,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:26:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:26:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:02,694 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:02,710 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2023-02-13 23:26:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:26:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-13 23:26:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:02,711 INFO L225 Difference]: With dead ends: 137 [2023-02-13 23:26:02,711 INFO L226 Difference]: Without dead ends: 96 [2023-02-13 23:26:02,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:02,714 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:02,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:26:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-13 23:26:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2023-02-13 23:26:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-02-13 23:26:02,722 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2023-02-13 23:26:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:02,722 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-02-13 23:26:02,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-02-13 23:26:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-13 23:26:02,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:02,723 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] [2023-02-13 23:26:02,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-13 23:26:02,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2023-02-13 23:26:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:02,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483754410] [2023-02-13 23:26:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:02,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:02,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483754410] [2023-02-13 23:26:02,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483754410] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:02,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:02,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:26:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938490220] [2023-02-13 23:26:02,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:02,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:26:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:02,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:26:02,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:02,773 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:02,788 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-02-13 23:26:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:26:02,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-13 23:26:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:02,789 INFO L225 Difference]: With dead ends: 75 [2023-02-13 23:26:02,789 INFO L226 Difference]: Without dead ends: 73 [2023-02-13 23:26:02,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:02,791 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:02,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:26:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-13 23:26:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-13 23:26:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-02-13 23:26:02,807 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2023-02-13 23:26:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:02,807 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-02-13 23:26:02,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-02-13 23:26:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-13 23:26:02,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:02,811 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] [2023-02-13 23:26:02,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-13 23:26:02,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2023-02-13 23:26:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:02,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894140508] [2023-02-13 23:26:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:02,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894140508] [2023-02-13 23:26:02,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894140508] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:02,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:02,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:26:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752300006] [2023-02-13 23:26:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:02,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:26:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:26:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:26:02,957 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:03,019 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-02-13 23:26:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-13 23:26:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-13 23:26:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:03,021 INFO L225 Difference]: With dead ends: 74 [2023-02-13 23:26:03,021 INFO L226 Difference]: Without dead ends: 72 [2023-02-13 23:26:03,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:26:03,022 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:03,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-13 23:26:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-02-13 23:26:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2023-02-13 23:26:03,028 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2023-02-13 23:26:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:03,029 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2023-02-13 23:26:03,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2023-02-13 23:26:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-13 23:26:03,030 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:03,030 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] [2023-02-13 23:26:03,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-13 23:26:03,030 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2023-02-13 23:26:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:03,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283846760] [2023-02-13 23:26:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:03,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283846760] [2023-02-13 23:26:03,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283846760] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:03,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:03,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:26:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268011696] [2023-02-13 23:26:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:03,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:26:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:26:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:26:03,198 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:03,386 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2023-02-13 23:26:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 23:26:03,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-13 23:26:03,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:03,388 INFO L225 Difference]: With dead ends: 175 [2023-02-13 23:26:03,388 INFO L226 Difference]: Without dead ends: 133 [2023-02-13 23:26:03,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:26:03,391 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:03,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 278 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-13 23:26:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2023-02-13 23:26:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2023-02-13 23:26:03,401 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2023-02-13 23:26:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:03,402 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2023-02-13 23:26:03,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2023-02-13 23:26:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-13 23:26:03,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:03,404 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] [2023-02-13 23:26:03,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-13 23:26:03,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2023-02-13 23:26:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:03,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245290824] [2023-02-13 23:26:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245290824] [2023-02-13 23:26:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245290824] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:05,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:05,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-13 23:26:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030234521] [2023-02-13 23:26:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:05,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:26:05,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:05,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:26:05,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:26:05,354 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:05,808 INFO L93 Difference]: Finished difference Result 232 states and 257 transitions. [2023-02-13 23:26:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 23:26:05,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-13 23:26:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:05,811 INFO L225 Difference]: With dead ends: 232 [2023-02-13 23:26:05,811 INFO L226 Difference]: Without dead ends: 230 [2023-02-13 23:26:05,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-13 23:26:05,812 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 254 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:05,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 419 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-13 23:26:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-13 23:26:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 93. [2023-02-13 23:26:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2023-02-13 23:26:05,830 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2023-02-13 23:26:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:05,831 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2023-02-13 23:26:05,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2023-02-13 23:26:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-13 23:26:05,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:05,835 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] [2023-02-13 23:26:05,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-13 23:26:05,836 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2023-02-13 23:26:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:05,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326492690] [2023-02-13 23:26:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:26:05,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:05,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326492690] [2023-02-13 23:26:05,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326492690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:05,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:05,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:26:05,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103672899] [2023-02-13 23:26:05,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:26:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:05,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:26:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:26:05,927 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:06,053 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2023-02-13 23:26:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:26:06,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-13 23:26:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:06,054 INFO L225 Difference]: With dead ends: 140 [2023-02-13 23:26:06,054 INFO L226 Difference]: Without dead ends: 122 [2023-02-13 23:26:06,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:26:06,055 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 24 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:06,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 234 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-13 23:26:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2023-02-13 23:26:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2023-02-13 23:26:06,079 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2023-02-13 23:26:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:06,080 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2023-02-13 23:26:06,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2023-02-13 23:26:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-13 23:26:06,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:06,082 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] [2023-02-13 23:26:06,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-13 23:26:06,082 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:06,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2023-02-13 23:26:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:06,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14849120] [2023-02-13 23:26:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:06,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:26:06,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:06,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14849120] [2023-02-13 23:26:06,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14849120] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:06,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:06,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:26:06,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69004714] [2023-02-13 23:26:06,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:06,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:26:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:06,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:26:06,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:06,144 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:06,197 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2023-02-13 23:26:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:26:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-13 23:26:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:06,199 INFO L225 Difference]: With dead ends: 114 [2023-02-13 23:26:06,199 INFO L226 Difference]: Without dead ends: 112 [2023-02-13 23:26:06,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:06,200 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:06,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:26:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-13 23:26:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-13 23:26:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2023-02-13 23:26:06,243 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2023-02-13 23:26:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:06,243 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2023-02-13 23:26:06,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2023-02-13 23:26:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-13 23:26:06,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:06,244 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] [2023-02-13 23:26:06,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-13 23:26:06,245 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2023-02-13 23:26:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:06,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796510762] [2023-02-13 23:26:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:08,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796510762] [2023-02-13 23:26:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796510762] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-13 23:26:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777747389] [2023-02-13 23:26:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:08,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:26:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:26:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:26:08,222 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:08,600 INFO L93 Difference]: Finished difference Result 266 states and 306 transitions. [2023-02-13 23:26:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-13 23:26:08,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-13 23:26:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:08,602 INFO L225 Difference]: With dead ends: 266 [2023-02-13 23:26:08,602 INFO L226 Difference]: Without dead ends: 264 [2023-02-13 23:26:08,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-13 23:26:08,603 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 259 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:08,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 381 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-13 23:26:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-02-13 23:26:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 114. [2023-02-13 23:26:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2023-02-13 23:26:08,632 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2023-02-13 23:26:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:08,633 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2023-02-13 23:26:08,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2023-02-13 23:26:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-13 23:26:08,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:08,634 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-13 23:26:08,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-13 23:26:08,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:08,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2023-02-13 23:26:08,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:08,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706599527] [2023-02-13 23:26:08,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:08,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:08,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:08,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706599527] [2023-02-13 23:26:08,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706599527] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:26:08,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866658010] [2023-02-13 23:26:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:26:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:26:08,772 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) [2023-02-13 23:26:08,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-13 23:26:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:08,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-13 23:26:08,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:26:08,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:08,938 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2023-02-13 23:26:08,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:08,946 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2023-02-13 23:26:08,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:08,999 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-02-13 23:26:09,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:09,009 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-02-13 23:26:09,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:26:09,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:26:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:09,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:26:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:09,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866658010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:26:09,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:26:09,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-13 23:26:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180459360] [2023-02-13 23:26:09,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:26:09,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:26:09,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:26:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:26:09,198 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:09,369 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2023-02-13 23:26:09,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:26:09,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-13 23:26:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:09,371 INFO L225 Difference]: With dead ends: 201 [2023-02-13 23:26:09,371 INFO L226 Difference]: Without dead ends: 141 [2023-02-13 23:26:09,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:26:09,373 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 151 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:09,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 164 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-13 23:26:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2023-02-13 23:26:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2023-02-13 23:26:09,403 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2023-02-13 23:26:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:09,404 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2023-02-13 23:26:09,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2023-02-13 23:26:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-13 23:26:09,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:09,405 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] [2023-02-13 23:26:09,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-13 23:26:09,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-13 23:26:09,612 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:09,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2023-02-13 23:26:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65208099] [2023-02-13 23:26:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:26:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:11,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65208099] [2023-02-13 23:26:11,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65208099] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:11,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:11,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:26:11,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52728783] [2023-02-13 23:26:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:11,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:26:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:26:11,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:26:11,062 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:11,359 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2023-02-13 23:26:11,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-13 23:26:11,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-13 23:26:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:11,361 INFO L225 Difference]: With dead ends: 178 [2023-02-13 23:26:11,361 INFO L226 Difference]: Without dead ends: 176 [2023-02-13 23:26:11,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-13 23:26:11,362 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:11,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 259 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-13 23:26:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-13 23:26:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 122. [2023-02-13 23:26:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2023-02-13 23:26:11,392 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 29 [2023-02-13 23:26:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:11,392 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2023-02-13 23:26:11,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2023-02-13 23:26:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-13 23:26:11,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:11,393 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] [2023-02-13 23:26:11,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-13 23:26:11,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2023-02-13 23:26:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:11,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979297857] [2023-02-13 23:26:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:11,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:11,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979297857] [2023-02-13 23:26:11,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979297857] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:11,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:11,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:26:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078853599] [2023-02-13 23:26:11,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:11,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:26:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:26:11,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:11,450 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:11,504 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2023-02-13 23:26:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:26:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-13 23:26:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:11,505 INFO L225 Difference]: With dead ends: 239 [2023-02-13 23:26:11,505 INFO L226 Difference]: Without dead ends: 178 [2023-02-13 23:26:11,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:26:11,507 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:11,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:26:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-13 23:26:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 144. [2023-02-13 23:26:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.2158273381294964) internal successors, (169), 143 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-02-13 23:26:11,544 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 31 [2023-02-13 23:26:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:11,544 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-02-13 23:26:11,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-02-13 23:26:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-13 23:26:11,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:11,546 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-13 23:26:11,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-13 23:26:11,547 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:11,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2023-02-13 23:26:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:11,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9051537] [2023-02-13 23:26:11,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:11,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:11,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9051537] [2023-02-13 23:26:11,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9051537] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:26:11,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451091863] [2023-02-13 23:26:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:11,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:26:11,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:26:11,689 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) [2023-02-13 23:26:11,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-13 23:26:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:11,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-13 23:26:11,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:26:11,831 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2023-02-13 23:26:11,836 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2023-02-13 23:26:11,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-13 23:26:11,866 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-02-13 23:26:11,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:26:11,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-13 23:26:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:26:11,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:26:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:26:12,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451091863] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:26:12,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:26:12,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-02-13 23:26:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421871722] [2023-02-13 23:26:12,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:26:12,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:26:12,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:26:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:26:12,041 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:12,300 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2023-02-13 23:26:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-13 23:26:12,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-13 23:26:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:12,302 INFO L225 Difference]: With dead ends: 254 [2023-02-13 23:26:12,302 INFO L226 Difference]: Without dead ends: 222 [2023-02-13 23:26:12,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-13 23:26:12,303 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 94 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:12,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-13 23:26:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-13 23:26:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 171. [2023-02-13 23:26:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2023-02-13 23:26:12,351 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 32 [2023-02-13 23:26:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:12,351 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2023-02-13 23:26:12,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2023-02-13 23:26:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-13 23:26:12,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:12,352 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] [2023-02-13 23:26:12,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-13 23:26:12,557 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,SelfDestructingSolverStorable17 [2023-02-13 23:26:12,558 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1670306697, now seen corresponding path program 1 times [2023-02-13 23:26:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:12,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84326127] [2023-02-13 23:26:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-13 23:26:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:14,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84326127] [2023-02-13 23:26:14,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84326127] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:14,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:14,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-13 23:26:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043304688] [2023-02-13 23:26:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:14,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:26:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:26:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:26:14,251 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:14,482 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2023-02-13 23:26:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:26:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-13 23:26:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:14,484 INFO L225 Difference]: With dead ends: 203 [2023-02-13 23:26:14,484 INFO L226 Difference]: Without dead ends: 188 [2023-02-13 23:26:14,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-13 23:26:14,485 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 138 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:14,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 199 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-13 23:26:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 161. [2023-02-13 23:26:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 160 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 192 transitions. [2023-02-13 23:26:14,523 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 192 transitions. Word has length 32 [2023-02-13 23:26:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:14,523 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 192 transitions. [2023-02-13 23:26:14,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 192 transitions. [2023-02-13 23:26:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-13 23:26:14,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:14,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:26:14,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-13 23:26:14,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2023-02-13 23:26:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:14,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728263285] [2023-02-13 23:26:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:14,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728263285] [2023-02-13 23:26:14,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728263285] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:26:14,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:26:14,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-13 23:26:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307358274] [2023-02-13 23:26:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:26:14,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-13 23:26:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-13 23:26:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:26:14,613 INFO L87 Difference]: Start difference. First operand 161 states and 192 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:14,704 INFO L93 Difference]: Finished difference Result 223 states and 263 transitions. [2023-02-13 23:26:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:26:14,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-13 23:26:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:14,705 INFO L225 Difference]: With dead ends: 223 [2023-02-13 23:26:14,706 INFO L226 Difference]: Without dead ends: 97 [2023-02-13 23:26:14,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-13 23:26:14,707 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:14,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 187 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:26:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-13 23:26:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-02-13 23:26:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-02-13 23:26:14,725 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2023-02-13 23:26:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:14,725 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-02-13 23:26:14,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-02-13 23:26:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-13 23:26:14,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:14,726 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-13 23:26:14,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-13 23:26:14,727 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2023-02-13 23:26:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:14,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418455882] [2023-02-13 23:26:14,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:14,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:15,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418455882] [2023-02-13 23:26:15,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418455882] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:26:15,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610597562] [2023-02-13 23:26:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:15,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:26:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:26:15,371 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) [2023-02-13 23:26:15,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-13 23:26:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:15,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-13 23:26:15,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:26:15,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-13 23:26:15,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-13 23:26:15,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-13 23:26:15,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:15,656 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2023-02-13 23:26:15,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:15,668 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2023-02-13 23:26:15,688 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-02-13 23:26:15,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 65 [2023-02-13 23:26:15,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:15,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:15,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:15,707 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 27 [2023-02-13 23:26:15,715 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-13 23:26:15,725 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-13 23:26:15,726 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-13 23:26:15,882 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-13 23:26:15,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-13 23:26:15,894 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 27 [2023-02-13 23:26:16,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:16,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-13 23:26:16,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:16,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:26:16,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-02-13 23:26:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:16,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:26:18,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:18,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:26:18,700 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2023-02-13 23:26:18,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:18,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:26:18,709 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-02-13 23:26:18,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:18,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-02-13 23:26:18,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:18,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-13 23:26:18,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 100 [2023-02-13 23:26:18,730 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 24 [2023-02-13 23:26:18,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-02-13 23:26:18,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-13 23:26:18,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:18,744 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-13 23:26:18,744 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2023-02-13 23:26:18,748 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:18,752 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-13 23:26:18,753 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2023-02-13 23:26:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:18,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610597562] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:26:18,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:26:18,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2023-02-13 23:26:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054456602] [2023-02-13 23:26:18,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:26:18,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-13 23:26:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:26:18,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-13 23:26:18,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2023-02-13 23:26:18,796 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:26:20,855 INFO L93 Difference]: Finished difference Result 274 states and 313 transitions. [2023-02-13 23:26:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-13 23:26:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-13 23:26:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:26:20,857 INFO L225 Difference]: With dead ends: 274 [2023-02-13 23:26:20,857 INFO L226 Difference]: Without dead ends: 214 [2023-02-13 23:26:20,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=202, Invalid=606, Unknown=4, NotChecked=0, Total=812 [2023-02-13 23:26:20,858 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 452 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 55 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-13 23:26:20,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 586 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 370 Invalid, 5 Unknown, 0 Unchecked, 1.5s Time] [2023-02-13 23:26:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-13 23:26:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 113. [2023-02-13 23:26:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.18348623853211) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2023-02-13 23:26:20,882 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 36 [2023-02-13 23:26:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:26:20,883 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2023-02-13 23:26:20,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-13 23:26:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2023-02-13 23:26:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-13 23:26:20,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:26:20,884 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-13 23:26:20,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-13 23:26:21,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:26:21,090 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-13 23:26:21,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:26:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 878042536, now seen corresponding path program 1 times [2023-02-13 23:26:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:26:21,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601747144] [2023-02-13 23:26:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:26:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:26:23,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601747144] [2023-02-13 23:26:23,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601747144] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:26:23,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138285083] [2023-02-13 23:26:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:26:23,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:26:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:26:23,801 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) [2023-02-13 23:26:23,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-13 23:26:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:26:24,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-13 23:26:24,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:26:24,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-13 23:26:24,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:24,109 INFO L321 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2023-02-13 23:26:24,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 383 treesize of output 326 [2023-02-13 23:26:24,183 INFO L321 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2023-02-13 23:26:24,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 491 treesize of output 404 [2023-02-13 23:26:24,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:24,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:24,273 INFO L321 Elim1Store]: treesize reduction 575, result has 3.8 percent of original size [2023-02-13 23:26:24,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 368 treesize of output 516 [2023-02-13 23:26:24,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:24,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:24,356 INFO L321 Elim1Store]: treesize reduction 404, result has 5.4 percent of original size [2023-02-13 23:26:24,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 393 treesize of output 457 [2023-02-13 23:26:24,374 INFO L350 Elim1Store]: Elim1 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 107 treesize of output 67 [2023-02-13 23:26:24,386 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:24,389 INFO L350 Elim1Store]: Elim1 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 123 treesize of output 82 [2023-02-13 23:26:24,426 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-13 23:26:24,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-13 23:26:24,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-13 23:26:24,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-13 23:26:24,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2023-02-13 23:26:24,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-13 23:26:24,575 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-13 23:26:24,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2023-02-13 23:26:24,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:26:24,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-13 23:26:24,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:26:24,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:26:24,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:26:24,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:26:24,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 78 [2023-02-13 23:26:24,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 78 [2023-02-13 23:26:24,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:24,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 42 treesize of output 88 [2023-02-13 23:26:24,893 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:24,894 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:24,895 INFO L350 Elim1Store]: Elim1 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 53 treesize of output 3 [2023-02-13 23:26:24,921 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:24,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 42 treesize of output 88 [2023-02-13 23:26:24,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 97 [2023-02-13 23:26:24,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:26:24,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 104 [2023-02-13 23:26:25,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2023-02-13 23:26:25,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2023-02-13 23:26:25,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:25,248 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-13 23:26:25,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 81 [2023-02-13 23:26:25,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2023-02-13 23:26:25,286 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-02-13 23:26:25,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 103 [2023-02-13 23:26:25,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,299 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:25,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2023-02-13 23:26:25,307 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2023-02-13 23:26:25,347 INFO L321 Elim1Store]: treesize reduction 8, result has 74.2 percent of original size [2023-02-13 23:26:25,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2023-02-13 23:26:25,541 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-13 23:26:25,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 76 [2023-02-13 23:26:25,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2023-02-13 23:26:25,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,952 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-13 23:26:25,969 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-13 23:26:25,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 45 [2023-02-13 23:26:25,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-13 23:26:25,981 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-13 23:26:25,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2023-02-13 23:26:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:26:25,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:26:26,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1738))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1739) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8)) 0)) (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1739))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1738) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8))) 0)))) is different from false [2023-02-13 23:26:26,162 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0))) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_1735 Int)) (or (forall ((v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1735)))) (let ((.cse3 (select (select (store .cse2 v_ArrVal_1735 v_ArrVal_1719) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse0 (store (store .cse2 v_ArrVal_1735 v_ArrVal_1728) .cse3 v_ArrVal_1738))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ 8 (select (select (store (store .cse4 v_ArrVal_1735 v_ArrVal_1721) .cse3 v_ArrVal_1739) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) 0)) (not (= (select |c_#valid| v_ArrVal_1735) 0)))) (forall ((v_ArrVal_1735 Int)) (or (not (= (select |c_#valid| v_ArrVal_1735) 0)) (forall ((v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1735)))) (let ((.cse8 (select (select (store .cse7 v_ArrVal_1735 v_ArrVal_1719) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse6 (store (store .cse4 v_ArrVal_1735 v_ArrVal_1721) .cse8 v_ArrVal_1739))) (select (select .cse6 (select (select (store (store .cse7 v_ArrVal_1735 v_ArrVal_1728) .cse8 v_ArrVal_1738) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ 8 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) 0)))))) is different from false [2023-02-13 23:26:29,196 INFO L321 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2023-02-13 23:26:29,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35939 treesize of output 26749 [2023-02-13 23:26:33,489 INFO L321 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2023-02-13 23:26:33,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 151115 treesize of output 114109