./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/calendar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e1ff0e6 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/heap-data/calendar.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 fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-14 22:59:02,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:59:02,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:59:02,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:59:02,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:59:02,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:59:02,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:59:02,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:59:02,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:59:02,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:59:02,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:59:02,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:59:02,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:59:02,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:59:02,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:59:02,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:59:02,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:59:02,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:59:02,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:59:02,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:59:02,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:59:02,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:59:02,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:59:02,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:59:02,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:59:02,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:59:02,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:59:02,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:59:02,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:59:02,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:59:02,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:59:02,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:59:02,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:59:02,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:59:02,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:59:02,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:59:02,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:59:02,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:59:02,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:59:02,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:59:02,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:59:02,243 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 22:59:02,265 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:59:02,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:59:02,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:59:02,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:59:02,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:59:02,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:59:02,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:59:02,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:59:02,266 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:59:02,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:59:02,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:59:02,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:59:02,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:59:02,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:59:02,269 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:59:02,269 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 -> fe08ef78ee5c945bc38e9e915e26405aefe9ffb2d4911c91347e07e6a879dcd5 [2023-02-14 22:59:02,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:59:02,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:59:02,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:59:02,472 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:59:02,472 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:59:02,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/calendar.i [2023-02-14 22:59:03,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:59:03,564 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:59:03,565 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/calendar.i [2023-02-14 22:59:03,572 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c61e532f/5728cf9810e44b1d8864a7706245bd4e/FLAGbd63cb731 [2023-02-14 22:59:03,581 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c61e532f/5728cf9810e44b1d8864a7706245bd4e [2023-02-14 22:59:03,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:59:03,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:59:03,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:59:03,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:59:03,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:59:03,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e94bd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03, skipping insertion in model container [2023-02-14 22:59:03,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:59:03,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:59:03,758 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/heap-data/calendar.i[23742,23755] [2023-02-14 22:59:03,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:59:03,769 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:59:03,818 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/heap-data/calendar.i[23742,23755] [2023-02-14 22:59:03,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:59:03,842 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:59:03,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03 WrapperNode [2023-02-14 22:59:03,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:59:03,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:59:03,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:59:03,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:59:03,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,880 INFO L138 Inliner]: procedures = 121, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2023-02-14 22:59:03,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:59:03,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:59:03,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:59:03,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:59:03,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,912 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:59:03,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:59:03,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:59:03,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:59:03,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (1/1) ... [2023-02-14 22:59:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:59:03,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:03,955 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-14 22:59:03,972 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-14 22:59:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 22:59:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 22:59:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 22:59:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:59:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 22:59:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 22:59:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 22:59:03,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:59:03,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:59:04,077 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:59:04,079 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:59:04,179 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:59:04,183 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:59:04,183 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 22:59:04,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:59:04 BoogieIcfgContainer [2023-02-14 22:59:04,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:59:04,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:59:04,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:59:04,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:59:04,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:59:03" (1/3) ... [2023-02-14 22:59:04,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f22da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:59:04, skipping insertion in model container [2023-02-14 22:59:04,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:59:03" (2/3) ... [2023-02-14 22:59:04,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f22da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:59:04, skipping insertion in model container [2023-02-14 22:59:04,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:59:04" (3/3) ... [2023-02-14 22:59:04,189 INFO L112 eAbstractionObserver]: Analyzing ICFG calendar.i [2023-02-14 22:59:04,200 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:59:04,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:59:04,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:59:04,231 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;@7be6d8b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:59:04,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:59:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 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-14 22:59:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 22:59:04,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:04,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:04,239 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash 399551724, now seen corresponding path program 1 times [2023-02-14 22:59:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:04,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51087326] [2023-02-14 22:59:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:04,334 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-14 22:59:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:04,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51087326] [2023-02-14 22:59:04,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51087326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:59:04,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:59:04,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 22:59:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610259053] [2023-02-14 22:59:04,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:59:04,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 22:59:04,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:04,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 22:59:04,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:59:04,361 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-14 22:59:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:04,375 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2023-02-14 22:59:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 22:59:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-14 22:59:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:04,382 INFO L225 Difference]: With dead ends: 35 [2023-02-14 22:59:04,382 INFO L226 Difference]: Without dead ends: 18 [2023-02-14 22:59:04,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:59:04,389 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:04,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:59:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-14 22:59:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-14 22:59:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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-14 22:59:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-02-14 22:59:04,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2023-02-14 22:59:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:04,413 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-02-14 22:59:04,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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-14 22:59:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-02-14 22:59:04,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 22:59:04,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:04,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:04,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 22:59:04,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1946762309, now seen corresponding path program 1 times [2023-02-14 22:59:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:04,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780394973] [2023-02-14 22:59:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:04,521 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-14 22:59:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:04,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780394973] [2023-02-14 22:59:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780394973] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:59:04,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:59:04,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 22:59:04,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9299003] [2023-02-14 22:59:04,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:59:04,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 22:59:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 22:59:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 22:59:04,525 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-14 22:59:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:04,561 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-14 22:59:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 22:59:04,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-02-14 22:59:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:04,562 INFO L225 Difference]: With dead ends: 35 [2023-02-14 22:59:04,562 INFO L226 Difference]: Without dead ends: 23 [2023-02-14 22:59:04,562 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-14 22:59:04,563 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:04,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:59:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-14 22:59:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-14 22:59:04,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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-14 22:59:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-02-14 22:59:04,578 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2023-02-14 22:59:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:04,579 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-02-14 22:59:04,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-14 22:59:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-02-14 22:59:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 22:59:04,581 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:04,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:04,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 22:59:04,582 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1070818203, now seen corresponding path program 1 times [2023-02-14 22:59:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:04,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999904704] [2023-02-14 22:59:04,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:05,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999904704] [2023-02-14 22:59:05,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999904704] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:59:05,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:59:05,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 22:59:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549293076] [2023-02-14 22:59:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:59:05,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 22:59:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:05,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 22:59:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 22:59:05,143 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-14 22:59:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:05,536 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2023-02-14 22:59:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 22:59:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2023-02-14 22:59:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:05,540 INFO L225 Difference]: With dead ends: 78 [2023-02-14 22:59:05,540 INFO L226 Difference]: Without dead ends: 68 [2023-02-14 22:59:05,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2023-02-14 22:59:05,547 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:05,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 114 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:59:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-14 22:59:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 27. [2023-02-14 22:59:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-14 22:59:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-14 22:59:05,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2023-02-14 22:59:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:05,559 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-14 22:59:05,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-14 22:59:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-14 22:59:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 22:59:05,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:05,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:05,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 22:59:05,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:05,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1737463723, now seen corresponding path program 1 times [2023-02-14 22:59:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:05,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571530568] [2023-02-14 22:59:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 22:59:05,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:05,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571530568] [2023-02-14 22:59:05,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571530568] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:59:05,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:59:05,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 22:59:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485665760] [2023-02-14 22:59:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:59:05,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 22:59:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 22:59:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 22:59:05,630 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-14 22:59:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:05,692 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2023-02-14 22:59:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 22:59:05,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 19 [2023-02-14 22:59:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:05,694 INFO L225 Difference]: With dead ends: 50 [2023-02-14 22:59:05,695 INFO L226 Difference]: Without dead ends: 38 [2023-02-14 22:59:05,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-14 22:59:05,702 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:05,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:59:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-14 22:59:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2023-02-14 22:59:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 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-14 22:59:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-02-14 22:59:05,710 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2023-02-14 22:59:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:05,710 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-02-14 22:59:05,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-14 22:59:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-02-14 22:59:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 22:59:05,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:05,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:05,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 22:59:05,712 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:05,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1737523305, now seen corresponding path program 1 times [2023-02-14 22:59:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:05,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728755422] [2023-02-14 22:59:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 22:59:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728755422] [2023-02-14 22:59:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728755422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:59:05,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:59:05,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 22:59:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593700438] [2023-02-14 22:59:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:59:05,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 22:59:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 22:59:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 22:59:05,748 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-14 22:59:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:05,761 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-02-14 22:59:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 22:59:05,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2023-02-14 22:59:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:05,762 INFO L225 Difference]: With dead ends: 34 [2023-02-14 22:59:05,762 INFO L226 Difference]: Without dead ends: 32 [2023-02-14 22:59:05,762 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-14 22:59:05,763 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 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-14 22:59:05,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:59:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-14 22:59:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-14 22:59:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-14 22:59:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-02-14 22:59:05,767 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2023-02-14 22:59:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:05,767 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-02-14 22:59:05,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-14 22:59:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-02-14 22:59:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 22:59:05,768 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:05,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:05,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 22:59:05,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:05,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash -782496211, now seen corresponding path program 1 times [2023-02-14 22:59:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:05,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370000234] [2023-02-14 22:59:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:05,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:05,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370000234] [2023-02-14 22:59:05,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370000234] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:59:05,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:59:05,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 22:59:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242624488] [2023-02-14 22:59:05,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:59:05,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 22:59:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:05,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 22:59:05,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 22:59:05,939 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-14 22:59:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:06,160 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2023-02-14 22:59:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 22:59:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2023-02-14 22:59:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:06,161 INFO L225 Difference]: With dead ends: 76 [2023-02-14 22:59:06,161 INFO L226 Difference]: Without dead ends: 74 [2023-02-14 22:59:06,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2023-02-14 22:59:06,161 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 109 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:06,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 108 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:59:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-14 22:59:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 35. [2023-02-14 22:59:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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-14 22:59:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-02-14 22:59:06,166 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 19 [2023-02-14 22:59:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:06,166 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-02-14 22:59:06,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-14 22:59:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-02-14 22:59:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 22:59:06,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:06,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:06,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 22:59:06,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash 830966801, now seen corresponding path program 1 times [2023-02-14 22:59:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:06,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007431026] [2023-02-14 22:59:06,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:06,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:06,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007431026] [2023-02-14 22:59:06,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007431026] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:06,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831254395] [2023-02-14 22:59:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:06,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:06,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:06,299 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-14 22:59:06,336 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-14 22:59:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:06,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-14 22:59:06,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:06,526 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 11 treesize of output 7 [2023-02-14 22:59:06,530 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 11 treesize of output 7 [2023-02-14 22:59:06,663 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-14 22:59:06,665 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-14 22:59:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:06,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:06,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831254395] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:06,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:06,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-02-14 22:59:06,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983216650] [2023-02-14 22:59:06,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:06,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 22:59:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:06,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 22:59:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-14 22:59:06,729 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-14 22:59:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:06,835 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2023-02-14 22:59:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 22:59:06,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 25 [2023-02-14 22:59:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:06,837 INFO L225 Difference]: With dead ends: 68 [2023-02-14 22:59:06,837 INFO L226 Difference]: Without dead ends: 40 [2023-02-14 22:59:06,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-14 22:59:06,838 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:06,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:59:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-14 22:59:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-14 22:59:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 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-14 22:59:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2023-02-14 22:59:06,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 25 [2023-02-14 22:59:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:06,843 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2023-02-14 22:59:06,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-14 22:59:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2023-02-14 22:59:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 22:59:06,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:06,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:06,854 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-14 22:59:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:07,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1524144039, now seen corresponding path program 2 times [2023-02-14 22:59:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:07,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986471101] [2023-02-14 22:59:07,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:07,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:07,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986471101] [2023-02-14 22:59:07,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986471101] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:07,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434443910] [2023-02-14 22:59:07,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:59:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:07,637 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-14 22:59:07,639 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-14 22:59:07,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:59:07,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:59:07,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-14 22:59:07,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:07,729 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-14 22:59:07,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:07,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:07,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 22:59:07,790 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 11 treesize of output 7 [2023-02-14 22:59:07,794 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 11 treesize of output 7 [2023-02-14 22:59:07,800 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 22:59:07,801 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-14 22:59:07,806 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 32 treesize of output 28 [2023-02-14 22:59:07,962 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-14 22:59:07,964 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 41 treesize of output 25 [2023-02-14 22:59:08,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:08,052 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 46 treesize of output 26 [2023-02-14 22:59:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:08,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:08,252 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_192 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_10| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_10| v_ArrVal_192) |c_ULTIMATE.start_main_~l~0#1.base|))) (or (not (= 3 (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)))) (not (= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_10|) 0))))) is different from false [2023-02-14 22:59:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 22:59:08,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434443910] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:08,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:08,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 23 [2023-02-14 22:59:08,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366605496] [2023-02-14 22:59:08,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:08,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-14 22:59:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:08,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-14 22:59:08,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=405, Unknown=1, NotChecked=40, Total=506 [2023-02-14 22:59:08,320 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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-14 22:59:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:10,799 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2023-02-14 22:59:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-14 22:59:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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 30 [2023-02-14 22:59:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:10,801 INFO L225 Difference]: With dead ends: 136 [2023-02-14 22:59:10,802 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 22:59:10,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=847, Invalid=2236, Unknown=1, NotChecked=108, Total=3192 [2023-02-14 22:59:10,806 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 606 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:10,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 302 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 221 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2023-02-14 22:59:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 22:59:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 48. [2023-02-14 22:59:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 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-14 22:59:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-02-14 22:59:10,824 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 30 [2023-02-14 22:59:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:10,825 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-02-14 22:59:10,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 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-14 22:59:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-02-14 22:59:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 22:59:10,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:10,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:10,833 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-14 22:59:11,033 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,SelfDestructingSolverStorable7 [2023-02-14 22:59:11,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:11,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1895186671, now seen corresponding path program 1 times [2023-02-14 22:59:11,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:11,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688383000] [2023-02-14 22:59:11,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:11,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688383000] [2023-02-14 22:59:11,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688383000] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:11,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142359504] [2023-02-14 22:59:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:11,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:11,445 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-14 22:59:11,446 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-14 22:59:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:11,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-14 22:59:11,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:11,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:11,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:11,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 22:59:11,540 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-14 22:59:11,592 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 11 treesize of output 7 [2023-02-14 22:59:11,595 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 11 treesize of output 7 [2023-02-14 22:59:11,606 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 22:59:11,606 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-14 22:59:11,610 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 32 treesize of output 28 [2023-02-14 22:59:11,737 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 41 treesize of output 25 [2023-02-14 22:59:11,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-14 22:59:11,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:11,830 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 46 treesize of output 26 [2023-02-14 22:59:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:11,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:12,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142359504] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:12,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:12,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 18 [2023-02-14 22:59:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173035887] [2023-02-14 22:59:12,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:12,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 22:59:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 22:59:12,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=255, Unknown=1, NotChecked=0, Total=306 [2023-02-14 22:59:12,024 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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-14 22:59:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:12,743 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2023-02-14 22:59:12,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 22:59:12,744 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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-14 22:59:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:12,744 INFO L225 Difference]: With dead ends: 67 [2023-02-14 22:59:12,744 INFO L226 Difference]: Without dead ends: 65 [2023-02-14 22:59:12,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=363, Invalid=896, Unknown=1, NotChecked=0, Total=1260 [2023-02-14 22:59:12,746 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 216 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:12,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 247 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:59:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-14 22:59:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2023-02-14 22:59:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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-14 22:59:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2023-02-14 22:59:12,750 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 32 [2023-02-14 22:59:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:12,750 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2023-02-14 22:59:12,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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-14 22:59:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2023-02-14 22:59:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 22:59:12,751 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:12,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:12,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-14 22:59:12,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:12,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1135420755, now seen corresponding path program 3 times [2023-02-14 22:59:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:12,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15320151] [2023-02-14 22:59:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:12,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:13,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15320151] [2023-02-14 22:59:13,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15320151] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337794741] [2023-02-14 22:59:13,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:59:13,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:13,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:13,274 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-14 22:59:13,277 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-14 22:59:13,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-14 22:59:13,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:59:13,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-14 22:59:13,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:13,363 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-14 22:59:13,366 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 11 treesize of output 7 [2023-02-14 22:59:13,369 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 11 treesize of output 7 [2023-02-14 22:59:13,402 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:13,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:13,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:13,407 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 16 treesize of output 18 [2023-02-14 22:59:13,415 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 22:59:13,415 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-14 22:59:13,419 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 18 treesize of output 20 [2023-02-14 22:59:13,599 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-14 22:59:13,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2023-02-14 22:59:13,605 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 22:59:13,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-14 22:59:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:13,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:13,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:13,663 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-02-14 22:59:13,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:13,667 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-02-14 22:59:13,675 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 6 treesize of output 4 [2023-02-14 22:59:13,683 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 6 treesize of output 4 [2023-02-14 22:59:13,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:13,775 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-02-14 22:59:13,777 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:13,778 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 16 treesize of output 8 [2023-02-14 22:59:13,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:13,784 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-02-14 22:59:13,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:13,787 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 20 treesize of output 8 [2023-02-14 22:59:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:13,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337794741] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:13,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:13,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 16 [2023-02-14 22:59:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822452607] [2023-02-14 22:59:13,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:13,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 22:59:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 22:59:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-02-14 22:59:13,798 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 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-14 22:59:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:14,032 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2023-02-14 22:59:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 22:59:14,032 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 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 38 [2023-02-14 22:59:14,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:14,032 INFO L225 Difference]: With dead ends: 102 [2023-02-14 22:59:14,033 INFO L226 Difference]: Without dead ends: 61 [2023-02-14 22:59:14,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-02-14 22:59:14,033 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:14,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 314 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:59:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-14 22:59:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2023-02-14 22:59:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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-14 22:59:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2023-02-14 22:59:14,038 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 38 [2023-02-14 22:59:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:14,038 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2023-02-14 22:59:14,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 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-14 22:59:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2023-02-14 22:59:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 22:59:14,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:14,038 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:14,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 22:59:14,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:14,244 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1704598909, now seen corresponding path program 4 times [2023-02-14 22:59:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:14,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901629690] [2023-02-14 22:59:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901629690] [2023-02-14 22:59:14,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901629690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:14,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490974082] [2023-02-14 22:59:14,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:59:14,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:14,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:59:14,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 22:59:14,982 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:59:14,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:59:14,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 80 conjunts are in the unsatisfiable core [2023-02-14 22:59:14,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:14,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:14,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:15,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 22:59:15,006 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-14 22:59:15,058 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 11 treesize of output 7 [2023-02-14 22:59:15,062 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 11 treesize of output 7 [2023-02-14 22:59:15,073 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 22:59:15,073 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 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-14 22:59:15,091 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 22:59:15,091 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 21 treesize of output 29 [2023-02-14 22:59:15,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:15,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:15,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:15,192 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 16 treesize of output 18 [2023-02-14 22:59:15,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:15,201 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 59 treesize of output 49 [2023-02-14 22:59:15,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:15,209 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-14 22:59:15,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-02-14 22:59:15,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-02-14 22:59:15,628 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 22:59:15,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 149 [2023-02-14 22:59:15,683 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 22:59:15,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2023-02-14 22:59:16,327 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 22:59:16,328 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 22:59:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:16,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:16,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:16,501 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2023-02-14 22:59:16,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:16,506 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-02-14 22:59:16,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_481 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_22| Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_22| v_ArrVal_481) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_22| v_arrayElimArr_9) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_22| v_arrayElimArr_10) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= (select v_arrayElimArr_10 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= 3 (select .cse0 (+ 8 .cse1)))) (not (= (select .cse0 (+ 4 .cse1)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_22|) 0)) (not (= (select v_arrayElimArr_9 0) |c_ULTIMATE.start_main_~l~0#1.base|))))) is different from false [2023-02-14 22:59:16,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:16,570 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 107 [2023-02-14 22:59:16,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:16,574 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 101 treesize of output 83 [2023-02-14 22:59:16,576 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 98 treesize of output 78 [2023-02-14 22:59:16,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:16,583 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2023-02-14 22:59:16,585 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:16,588 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 49 treesize of output 37 [2023-02-14 22:59:16,677 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 22:59:16,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2023-02-14 22:59:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-02-14 22:59:16,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490974082] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:16,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:16,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 29 [2023-02-14 22:59:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863464735] [2023-02-14 22:59:16,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:16,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-14 22:59:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:16,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-14 22:59:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=683, Unknown=1, NotChecked=52, Total=812 [2023-02-14 22:59:16,681 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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-14 22:59:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:22,167 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2023-02-14 22:59:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-14 22:59:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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 43 [2023-02-14 22:59:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:22,168 INFO L225 Difference]: With dead ends: 169 [2023-02-14 22:59:22,168 INFO L226 Difference]: Without dead ends: 154 [2023-02-14 22:59:22,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1470, Invalid=4233, Unknown=1, NotChecked=148, Total=5852 [2023-02-14 22:59:22,170 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1022 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:22,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 395 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 289 Invalid, 0 Unknown, 94 Unchecked, 0.3s Time] [2023-02-14 22:59:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-14 22:59:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 64. [2023-02-14 22:59:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 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-14 22:59:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2023-02-14 22:59:22,179 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 43 [2023-02-14 22:59:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:22,179 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2023-02-14 22:59:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.793103448275862) internal successors, (110), 29 states have internal predecessors, (110), 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-14 22:59:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2023-02-14 22:59:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 22:59:22,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:22,180 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:22,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 22:59:22,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-14 22:59:22,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:22,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash -781342395, now seen corresponding path program 2 times [2023-02-14 22:59:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:22,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18798620] [2023-02-14 22:59:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:23,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18798620] [2023-02-14 22:59:23,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18798620] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:23,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69632998] [2023-02-14 22:59:23,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:59:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:23,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:23,152 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:59:23,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 22:59:23,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:59:23,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:59:23,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-14 22:59:23,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:23,265 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-14 22:59:23,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:23,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:23,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 22:59:23,293 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 11 treesize of output 7 [2023-02-14 22:59:23,301 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 22:59:23,301 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 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-14 22:59:23,316 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 22:59:23,316 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 21 treesize of output 29 [2023-02-14 22:59:23,322 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 11 treesize of output 7 [2023-02-14 22:59:23,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:23,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:23,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:23,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2023-02-14 22:59:23,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:23,416 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 59 treesize of output 49 [2023-02-14 22:59:23,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:23,422 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-14 22:59:23,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-02-14 22:59:23,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:23,427 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 18 treesize of output 20 [2023-02-14 22:59:23,817 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 22:59:23,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 149 [2023-02-14 22:59:23,866 INFO L321 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2023-02-14 22:59:23,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 119 [2023-02-14 22:59:24,374 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 22:59:24,375 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 22:59:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:24,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:24,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:24,472 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2023-02-14 22:59:24,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:24,477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-02-14 22:59:24,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:24,571 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 121 [2023-02-14 22:59:24,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:24,574 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 115 treesize of output 91 [2023-02-14 22:59:24,576 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 106 treesize of output 86 [2023-02-14 22:59:24,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:24,581 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2023-02-14 22:59:24,583 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:24,585 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 55 treesize of output 37 [2023-02-14 22:59:24,665 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 22:59:24,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2023-02-14 22:59:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:24,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69632998] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:24,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:24,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 25 [2023-02-14 22:59:24,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668707503] [2023-02-14 22:59:24,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:24,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-14 22:59:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:24,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-14 22:59:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=527, Unknown=2, NotChecked=0, Total=600 [2023-02-14 22:59:24,668 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 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-14 22:59:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:29,361 INFO L93 Difference]: Finished difference Result 160 states and 191 transitions. [2023-02-14 22:59:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-14 22:59:29,361 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 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 45 [2023-02-14 22:59:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:29,363 INFO L225 Difference]: With dead ends: 160 [2023-02-14 22:59:29,363 INFO L226 Difference]: Without dead ends: 158 [2023-02-14 22:59:29,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1573, Invalid=4745, Unknown=2, NotChecked=0, Total=6320 [2023-02-14 22:59:29,365 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 718 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:29,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 450 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 22:59:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-14 22:59:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 67. [2023-02-14 22:59:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 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-14 22:59:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2023-02-14 22:59:29,374 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 45 [2023-02-14 22:59:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:29,374 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2023-02-14 22:59:29,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 25 states have internal predecessors, (98), 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-14 22:59:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2023-02-14 22:59:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 22:59:29,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:29,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:29,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-14 22:59:29,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:29,584 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2085516585, now seen corresponding path program 5 times [2023-02-14 22:59:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:29,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196054263] [2023-02-14 22:59:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:30,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196054263] [2023-02-14 22:59:30,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196054263] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:30,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835979748] [2023-02-14 22:59:30,169 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:59:30,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:30,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:30,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:59:30,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 22:59:30,594 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-14 22:59:30,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:59:30,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 96 conjunts are in the unsatisfiable core [2023-02-14 22:59:30,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:30,617 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 11 treesize of output 7 [2023-02-14 22:59:30,619 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-14 22:59:30,621 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 11 treesize of output 7 [2023-02-14 22:59:30,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:30,652 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:30,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:30,659 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 16 treesize of output 18 [2023-02-14 22:59:30,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:30,665 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 16 treesize of output 18 [2023-02-14 22:59:30,674 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 22:59:30,675 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 21 treesize of output 29 [2023-02-14 22:59:30,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:30,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:30,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 22:59:30,749 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:30,753 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:30,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:30,763 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 22:59:30,764 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2023-02-14 22:59:30,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:30,776 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 22:59:30,776 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2023-02-14 22:59:30,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:30,795 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-14 22:59:30,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-02-14 22:59:30,801 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 6 treesize of output 5 [2023-02-14 22:59:31,415 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2023-02-14 22:59:31,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 150 treesize of output 88 [2023-02-14 22:59:31,432 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-14 22:59:31,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 35 [2023-02-14 22:59:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:31,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:31,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:31,899 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2023-02-14 22:59:31,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:31,912 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 111 [2023-02-14 22:59:32,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:32,229 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 387 treesize of output 367 [2023-02-14 22:59:32,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:32,237 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 360 treesize of output 340 [2023-02-14 22:59:32,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:32,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 333 treesize of output 302 [2023-02-14 22:59:32,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:32,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 509 treesize of output 643 [2023-02-14 22:59:32,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:32,298 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 369 treesize of output 372 [2023-02-14 22:59:32,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:32,315 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 333 treesize of output 336 [2023-02-14 22:59:35,642 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse1 (select v_prenex_8 0))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_27)) (.cse12 (store |c_#memory_$Pointer$.offset| .cse1 v_arrayElimArr_28))) (let ((.cse10 (store .cse12 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse6 (store .cse11 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25)) (.cse3 (store .cse12 v_prenex_9 v_prenex_7)) (.cse9 (store .cse11 v_prenex_9 v_prenex_8))) (let ((.cse4 (select (select .cse9 .cse1) 0)) (.cse5 (select (select .cse3 .cse1) 0)) (.cse7 (select (select .cse6 .cse1) 0)) (.cse8 (select (select .cse10 .cse1) 0))) (let ((.cse0 (select (select .cse10 .cse7) .cse8)) (.cse2 (select (select .cse9 .cse4) .cse5))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse0 0) (= .cse1 .cse2) (not (= (select |c_#valid| .cse1) 0)) (= (select (select .cse3 .cse4) .cse5) .cse0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse6 .cse7) .cse8) .cse1) (= .cse2 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse1 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse15 (select v_prenex_8 0))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse15 v_arrayElimArr_27)) (.cse16 (store |c_#memory_$Pointer$.offset| .cse15 v_arrayElimArr_28))) (let ((.cse17 (store .cse16 v_prenex_9 v_prenex_7)) (.cse20 (store .cse14 v_prenex_9 v_prenex_8))) (let ((.cse18 (select (select .cse20 .cse15) 0)) (.cse19 (select (select .cse17 .cse15) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse13 (store .cse16 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse13 (select (select (store .cse14 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse15) 0)) (select (select .cse13 .cse15) 0))) 0) (not (= (select |c_#valid| .cse15) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse17 .cse18) .cse19) 0) (= (select (select .cse20 .cse18) .cse19) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse15 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse21 (select v_arrayElimArr_25 0))) (let ((.cse23 (store |c_#memory_$Pointer$.base| .cse21 v_arrayElimArr_27)) (.cse24 (store |c_#memory_$Pointer$.offset| .cse21 v_arrayElimArr_28))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse21 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse22 (store .cse24 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse22 (select (select (store .cse23 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse21) 0)) (select (select .cse22 .cse21) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse21) 0)) (= (let ((.cse25 (store .cse24 v_prenex_9 v_prenex_7))) (select (select .cse25 (select (select (store .cse23 v_prenex_9 v_prenex_8) .cse21) 0)) (select (select .cse25 .cse21) 0))) 0) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse26 (select v_arrayElimArr_25 0))) (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse26 v_arrayElimArr_27)) (.cse29 (store |c_#memory_$Pointer$.offset| .cse26 v_arrayElimArr_28))) (or (= .cse26 (select (let ((.cse27 (store .cse28 v_prenex_9 v_prenex_8))) (select .cse27 (select (select .cse27 .cse26) 0))) (select (select (store .cse29 v_prenex_9 v_prenex_7) .cse26) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse26 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (let ((.cse30 (store .cse29 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse30 (select (select (store .cse28 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse26) 0)) (select (select .cse30 .cse26) 0))) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse26) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse31 (select v_prenex_8 0))) (let ((.cse34 (store |c_#memory_$Pointer$.base| .cse31 v_arrayElimArr_27)) (.cse35 (store |c_#memory_$Pointer$.offset| .cse31 v_arrayElimArr_28))) (let ((.cse32 (select (let ((.cse36 (store .cse34 v_prenex_9 v_prenex_8))) (select .cse36 (select (select .cse36 .cse31) 0))) (select (select (store .cse35 v_prenex_9 v_prenex_7) .cse31) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse31 .cse32) (not (= (select |c_#valid| .cse31) 0)) (= (select (let ((.cse33 (store .cse34 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse33 (select (select .cse33 .cse31) 0))) (select (select (store .cse35 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse31) 0)) .cse32) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse32 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse31 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse38 (select v_prenex_8 0))) (let ((.cse37 (select (let ((.cse39 (store (store |c_#memory_$Pointer$.base| .cse38 v_arrayElimArr_27) v_prenex_9 v_prenex_8))) (select .cse39 (select (select .cse39 .cse38) 0))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse38 v_arrayElimArr_28) v_prenex_9 v_prenex_7) .cse38) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_prenex_9 .cse37)) (not (= (select |c_#valid| .cse38) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse37 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse38 1) v_prenex_9) 0)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse43 (select v_prenex_8 0))) (let ((.cse47 (store |c_#memory_$Pointer$.base| .cse43 v_arrayElimArr_27)) (.cse48 (store |c_#memory_$Pointer$.offset| .cse43 v_arrayElimArr_28))) (let ((.cse40 (store .cse48 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse45 (store .cse47 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse41 (select (select .cse45 .cse43) 0)) (.cse42 (select (select .cse40 .cse43) 0)) (.cse44 (select (let ((.cse46 (store .cse47 v_prenex_9 v_prenex_8))) (select .cse46 (select (select .cse46 .cse43) 0))) (select (select (store .cse48 v_prenex_9 v_prenex_7) .cse43) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse40 .cse41) .cse42) 0) (= .cse43 .cse44) (not (= (select |c_#valid| .cse43) 0)) (= (select (select .cse45 .cse41) .cse42) .cse44) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse44 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse43 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse49 (select v_prenex_8 0))) (let ((.cse54 (store |c_#memory_$Pointer$.base| .cse49 v_arrayElimArr_27)) (.cse55 (store |c_#memory_$Pointer$.offset| .cse49 v_arrayElimArr_28))) (let ((.cse50 (store .cse55 v_prenex_9 v_prenex_7)) (.cse56 (store .cse54 v_prenex_9 v_prenex_8))) (let ((.cse51 (select (select .cse56 .cse49) 0)) (.cse52 (select (select .cse50 .cse49) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse49) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse50 .cse51) .cse52) 0) (= (select (let ((.cse53 (store .cse54 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse53 (select (select .cse53 .cse49) 0))) (select (select (store .cse55 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse49) 0)) .cse49) (= (select (select .cse56 .cse51) .cse52) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse49 1) v_prenex_9) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse61 (select v_arrayElimArr_25 0))) (let ((.cse62 (store |c_#memory_$Pointer$.base| .cse61 v_arrayElimArr_27)) (.cse63 (store |c_#memory_$Pointer$.offset| .cse61 v_arrayElimArr_28))) (let ((.cse64 (store .cse63 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse57 (store .cse62 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse58 (select (select .cse57 .cse61) 0)) (.cse59 (select (select .cse64 .cse61) 0))) (or (= (select (select .cse57 .cse58) .cse59) (select (let ((.cse60 (store .cse62 v_prenex_9 v_prenex_8))) (select .cse60 (select (select .cse60 .cse61) 0))) (select (select (store .cse63 v_prenex_9 v_prenex_7) .cse61) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse61 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse64 .cse58) .cse59) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse61) 0)) (not (= (select v_arrayElimArr_26 0) 0)))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse68 (select v_prenex_8 0))) (let ((.cse72 (store |c_#memory_$Pointer$.base| .cse68 v_arrayElimArr_27)) (.cse73 (store |c_#memory_$Pointer$.offset| .cse68 v_arrayElimArr_28))) (let ((.cse65 (store .cse73 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse74 (store .cse72 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse66 (select (select .cse74 .cse68) 0)) (.cse67 (select (select .cse65 .cse68) 0))) (let ((.cse70 (select (select .cse74 .cse66) .cse67)) (.cse69 (select (let ((.cse71 (store .cse72 v_prenex_9 v_prenex_8))) (select .cse71 (select (select .cse71 .cse68) 0))) (select (select (store .cse73 v_prenex_9 v_prenex_7) .cse68) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse65 .cse66) .cse67) 0) (= .cse68 .cse69) (not (= (select |c_#valid| .cse68) 0)) (= .cse70 .cse69) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse70 .cse68) (= .cse69 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse68 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse75 (select v_prenex_8 0))) (let ((.cse81 (store |c_#memory_$Pointer$.base| .cse75 v_arrayElimArr_27)) (.cse82 (store |c_#memory_$Pointer$.offset| .cse75 v_arrayElimArr_28))) (let ((.cse77 (store .cse82 v_prenex_9 v_prenex_7)) (.cse83 (store .cse81 v_prenex_9 v_prenex_8))) (let ((.cse78 (select (select .cse83 .cse75) 0)) (.cse79 (select (select .cse77 .cse75) 0))) (let ((.cse76 (select (select .cse83 .cse78) .cse79))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse75 .cse76) (not (= (select |c_#valid| .cse75) 0)) (= (select (select .cse77 .cse78) .cse79) (let ((.cse80 (store .cse82 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse80 (select (select (store .cse81 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse75) 0)) (select (select .cse80 .cse75) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse76 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse75 1) v_prenex_9) 0))))))))) (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int)) (let ((.cse84 (select v_arrayElimArr_25 0))) (let ((.cse85 (store (store |c_#memory_$Pointer$.offset| .cse84 v_arrayElimArr_28) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse88 (store (store |c_#memory_$Pointer$.base| .cse84 v_arrayElimArr_27) |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse86 (select (select .cse88 .cse84) 0)) (.cse87 (select (select .cse85 .cse84) 0))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse84 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse85 .cse86) .cse87) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse84) 0)) (not (= (select (select .cse88 .cse86) .cse87) |v_ULTIMATE.start_main_~l~0#1.base_33|)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse92 (select v_prenex_8 0))) (let ((.cse99 (store |c_#memory_$Pointer$.base| .cse92 v_arrayElimArr_27)) (.cse100 (store |c_#memory_$Pointer$.offset| .cse92 v_arrayElimArr_28))) (let ((.cse95 (store .cse100 v_prenex_9 v_prenex_7)) (.cse98 (store .cse99 v_prenex_9 v_prenex_8))) (let ((.cse96 (select (select .cse98 .cse92) 0)) (.cse97 (select (select .cse95 .cse92) 0)) (.cse89 (store .cse100 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse93 (store .cse99 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse90 (select (select .cse93 .cse92) 0)) (.cse91 (select (select .cse89 .cse92) 0)) (.cse94 (select (select .cse98 .cse96) .cse97))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse89 .cse90) .cse91) 0) (not (= (select |c_#valid| .cse92) 0)) (= (select (select .cse93 .cse90) .cse91) .cse94) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse95 .cse96) .cse97) 0) (= .cse94 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse92 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse104 (select v_arrayElimArr_25 0))) (let ((.cse103 (store |c_#memory_$Pointer$.base| .cse104 v_arrayElimArr_27)) (.cse105 (store |c_#memory_$Pointer$.offset| .cse104 v_arrayElimArr_28))) (let ((.cse101 (let ((.cse106 (store .cse105 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse106 (select (select (store .cse103 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse104) 0)) (select (select .cse106 .cse104) 0))))) (or (= .cse101 (let ((.cse102 (store .cse105 v_prenex_9 v_prenex_7))) (select (select .cse102 (select (select (store .cse103 v_prenex_9 v_prenex_8) .cse104) 0)) (select (select .cse102 .cse104) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse104 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse101 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse104) 0)) (not (= (select v_arrayElimArr_26 0) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse108 (select v_prenex_8 0))) (let ((.cse118 (store |c_#memory_$Pointer$.base| .cse108 v_arrayElimArr_27)) (.cse119 (store |c_#memory_$Pointer$.offset| .cse108 v_arrayElimArr_28))) (let ((.cse117 (store .cse119 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse110 (store .cse118 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25)) (.cse116 (store .cse119 v_prenex_9 v_prenex_7)) (.cse113 (store .cse118 v_prenex_9 v_prenex_8))) (let ((.cse114 (select (select .cse113 .cse108) 0)) (.cse115 (select (select .cse116 .cse108) 0)) (.cse111 (select (select .cse110 .cse108) 0)) (.cse112 (select (select .cse117 .cse108) 0))) (let ((.cse107 (select (select .cse117 .cse111) .cse112)) (.cse109 (select (select .cse116 .cse114) .cse115))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse107 0) (not (= (select |c_#valid| .cse108) 0)) (= .cse109 .cse107) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse109 0) (= (select (select .cse110 .cse111) .cse112) .cse108) (= (select (select .cse113 .cse114) .cse115) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse108 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse120 (select v_prenex_8 0))) (let ((.cse122 (store |c_#memory_$Pointer$.base| .cse120 v_arrayElimArr_27)) (.cse123 (store |c_#memory_$Pointer$.offset| .cse120 v_arrayElimArr_28))) (let ((.cse125 (store .cse123 v_prenex_9 v_prenex_7)) (.cse128 (store .cse122 v_prenex_9 v_prenex_8))) (let ((.cse126 (select (select .cse128 .cse120) 0)) (.cse127 (select (select .cse125 .cse120) 0))) (let ((.cse124 (select (select .cse128 .cse126) .cse127))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse120) 0)) (= (select (let ((.cse121 (store .cse122 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse121 (select (select .cse121 .cse120) 0))) (select (select (store .cse123 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse120) 0)) .cse124) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse125 .cse126) .cse127) 0) (= .cse124 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse120 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse129 (select v_prenex_8 0))) (let ((.cse132 (store |c_#memory_$Pointer$.base| .cse129 v_arrayElimArr_27)) (.cse133 (store |c_#memory_$Pointer$.offset| .cse129 v_arrayElimArr_28))) (let ((.cse130 (select (let ((.cse134 (store .cse132 v_prenex_9 v_prenex_8))) (select .cse134 (select (select .cse134 .cse129) 0))) (select (select (store .cse133 v_prenex_9 v_prenex_7) .cse129) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse129 .cse130) (not (= (select |c_#valid| .cse129) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (let ((.cse131 (store .cse132 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (select .cse131 (select (select .cse131 .cse129) 0))) (select (select (store .cse133 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26) .cse129) 0)) .cse129) (= .cse130 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse129 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse135 (select v_prenex_8 0))) (let ((.cse138 (store |c_#memory_$Pointer$.base| .cse135 v_arrayElimArr_27)) (.cse139 (store |c_#memory_$Pointer$.offset| .cse135 v_arrayElimArr_28))) (let ((.cse143 (store .cse139 v_prenex_9 v_prenex_7)) (.cse140 (store .cse138 v_prenex_9 v_prenex_8))) (let ((.cse141 (select (select .cse140 .cse135) 0)) (.cse142 (select (select .cse143 .cse135) 0))) (let ((.cse136 (select (select .cse143 .cse141) .cse142))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select |c_#valid| .cse135) 0)) (= .cse136 (let ((.cse137 (store .cse139 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse137 (select (select (store .cse138 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse135) 0)) (select (select .cse137 .cse135) 0)))) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse136 0) (= (select (select .cse140 .cse141) .cse142) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse135 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse146 (select v_prenex_8 0))) (let ((.cse145 (store |c_#memory_$Pointer$.base| .cse146 v_arrayElimArr_27)) (.cse147 (store |c_#memory_$Pointer$.offset| .cse146 v_arrayElimArr_28))) (let ((.cse148 (select (let ((.cse149 (store .cse145 v_prenex_9 v_prenex_8))) (select .cse149 (select (select .cse149 .cse146) 0))) (select (select (store .cse147 v_prenex_9 v_prenex_7) .cse146) 0)))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (let ((.cse144 (store .cse147 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse144 (select (select (store .cse145 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse146) 0)) (select (select .cse144 .cse146) 0))) 0) (= .cse146 .cse148) (not (= (select |c_#valid| .cse146) 0)) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse148 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse146 1) v_prenex_9) 0))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse153 (select v_arrayElimArr_25 0))) (let ((.cse152 (store |c_#memory_$Pointer$.base| .cse153 v_arrayElimArr_27)) (.cse154 (store |c_#memory_$Pointer$.offset| .cse153 v_arrayElimArr_28))) (let ((.cse158 (store .cse154 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse155 (store .cse152 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse156 (select (select .cse155 .cse153) 0)) (.cse157 (select (select .cse158 .cse153) 0))) (let ((.cse150 (select (select .cse158 .cse156) .cse157))) (or (= .cse150 (let ((.cse151 (store .cse154 v_prenex_9 v_prenex_7))) (select (select .cse151 (select (select (store .cse152 v_prenex_9 v_prenex_8) .cse153) 0)) (select (select .cse151 .cse153) 0)))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse153 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= .cse150 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse153) 0)) (= (select (select .cse155 .cse156) .cse157) .cse153) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse162 (select v_prenex_8 0))) (let ((.cse170 (store |c_#memory_$Pointer$.base| .cse162 v_arrayElimArr_27)) (.cse171 (store |c_#memory_$Pointer$.offset| .cse162 v_arrayElimArr_28))) (let ((.cse159 (store .cse171 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse169 (store .cse170 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25)) (.cse165 (store .cse171 v_prenex_9 v_prenex_7)) (.cse168 (store .cse170 v_prenex_9 v_prenex_8))) (let ((.cse166 (select (select .cse168 .cse162) 0)) (.cse167 (select (select .cse165 .cse162) 0)) (.cse160 (select (select .cse169 .cse162) 0)) (.cse161 (select (select .cse159 .cse162) 0))) (let ((.cse163 (select (select .cse169 .cse160) .cse161)) (.cse164 (select (select .cse168 .cse166) .cse167))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= (select (select .cse159 .cse160) .cse161) 0) (not (= (select |c_#valid| .cse162) 0)) (= .cse163 .cse164) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= (select (select .cse165 .cse166) .cse167) 0) (= .cse163 .cse162) (= .cse164 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse162 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse174 (select v_arrayElimArr_25 0))) (let ((.cse175 (store |c_#memory_$Pointer$.base| .cse174 v_arrayElimArr_27)) (.cse176 (store |c_#memory_$Pointer$.offset| .cse174 v_arrayElimArr_28))) (let ((.cse177 (store .cse176 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26)) (.cse180 (store .cse175 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25))) (let ((.cse178 (select (select .cse180 .cse174) 0)) (.cse179 (select (select .cse177 .cse174) 0))) (let ((.cse172 (select (select .cse180 .cse178) .cse179))) (or (= .cse172 (select (let ((.cse173 (store .cse175 v_prenex_9 v_prenex_8))) (select .cse173 (select (select .cse173 .cse174) 0))) (select (select (store .cse176 v_prenex_9 v_prenex_7) .cse174) 0))) (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (store |c_#valid| .cse174 1) |v_ULTIMATE.start_main_~l~0#1.base_33|) 0)) (= (select (select .cse177 .cse178) .cse179) 0) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse174) 0)) (= .cse172 .cse174) (not (= (select v_arrayElimArr_26 0) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse182 (select v_prenex_8 0))) (let ((.cse189 (store |c_#memory_$Pointer$.base| .cse182 v_arrayElimArr_27)) (.cse190 (store |c_#memory_$Pointer$.offset| .cse182 v_arrayElimArr_28))) (let ((.cse187 (store .cse190 v_prenex_9 v_prenex_7)) (.cse184 (store .cse189 v_prenex_9 v_prenex_8))) (let ((.cse185 (select (select .cse184 .cse182) 0)) (.cse186 (select (select .cse187 .cse182) 0))) (let ((.cse181 (let ((.cse188 (store .cse190 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse188 (select (select (store .cse189 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse182) 0)) (select (select .cse188 .cse182) 0)))) (.cse183 (select (select .cse187 .cse185) .cse186))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse181 0) (not (= (select |c_#valid| .cse182) 0)) (= .cse183 .cse181) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse183 0) (= (select (select .cse184 .cse185) .cse186) 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse182 1) v_prenex_9) 0))))))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_33| Int) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (let ((.cse192 (select v_prenex_8 0))) (let ((.cse199 (store |c_#memory_$Pointer$.base| .cse192 v_arrayElimArr_27)) (.cse200 (store |c_#memory_$Pointer$.offset| .cse192 v_arrayElimArr_28))) (let ((.cse194 (store .cse200 v_prenex_9 v_prenex_7)) (.cse197 (store .cse199 v_prenex_9 v_prenex_8))) (let ((.cse195 (select (select .cse197 .cse192) 0)) (.cse196 (select (select .cse194 .cse192) 0))) (let ((.cse191 (let ((.cse198 (store .cse200 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_26))) (select (select .cse198 (select (select (store .cse199 |v_ULTIMATE.start_main_~l~0#1.base_33| v_arrayElimArr_25) .cse192) 0)) (select (select .cse198 .cse192) 0)))) (.cse193 (select (select .cse197 .cse195) .cse196))) (or (not (= (select v_arrayElimArr_27 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (= .cse191 0) (= .cse192 .cse193) (not (= (select |c_#valid| .cse192) 0)) (= (select (select .cse194 .cse195) .cse196) .cse191) (not (= (select v_arrayElimArr_28 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse193 0) (not (= (select v_prenex_7 0) 0)) (not (= (select (store |c_#valid| .cse192 1) v_prenex_9) 0)))))))))) is different from false [2023-02-14 22:59:38,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:38,459 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 476 treesize of output 402 [2023-02-14 22:59:38,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:38,465 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 270 [2023-02-14 22:59:38,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:38,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:38,497 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2023-02-14 22:59:38,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3979 treesize of output 3381 [2023-02-14 22:59:38,503 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:38,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:38,544 INFO L321 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2023-02-14 22:59:38,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 3543 treesize of output 3537 [2023-02-14 22:59:38,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:38,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3089 treesize of output 2787 [2023-02-14 22:59:38,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:38,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2923 treesize of output 2577 [2023-02-14 22:59:38,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2854 treesize of output 2091 [2023-02-14 22:59:38,620 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:38,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:38,631 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 22:59:38,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2023-02-14 22:59:38,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:38,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 375 treesize of output 335 [2023-02-14 22:59:38,671 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-14 22:59:38,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 290 treesize of output 280 [2023-02-14 22:59:41,229 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,234 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 1 [2023-02-14 22:59:41,240 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,240 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 1 [2023-02-14 22:59:41,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:41,246 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 197 [2023-02-14 22:59:41,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:41,252 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 137 [2023-02-14 22:59:41,266 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:41,267 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:41,267 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:41,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:41,298 INFO L321 Elim1Store]: treesize reduction 43, result has 53.3 percent of original size [2023-02-14 22:59:41,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 422 treesize of output 324 [2023-02-14 22:59:41,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:41,303 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:41,304 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:41,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 300 [2023-02-14 22:59:41,350 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 322 treesize of output 266 [2023-02-14 22:59:41,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:41,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 232 treesize of output 214 [2023-02-14 22:59:41,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:41,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 227 treesize of output 213 [2023-02-14 22:59:41,391 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 22:59:41,392 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 22 treesize of output 18 [2023-02-14 22:59:41,434 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 46 treesize of output 40 [2023-02-14 22:59:41,439 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 46 treesize of output 38 [2023-02-14 22:59:41,604 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,604 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2023-02-14 22:59:41,611 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,611 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 1 [2023-02-14 22:59:41,617 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,617 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2023-02-14 22:59:41,623 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,623 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2023-02-14 22:59:41,629 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2023-02-14 22:59:41,635 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,635 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 1 [2023-02-14 22:59:41,641 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,642 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 22:59:41,648 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,648 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 1 [2023-02-14 22:59:41,655 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,655 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 1 [2023-02-14 22:59:41,661 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,662 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 22:59:41,669 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,670 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 1 [2023-02-14 22:59:41,676 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,677 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 476 treesize of output 1 [2023-02-14 22:59:41,684 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,684 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 22:59:41,691 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,691 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 1 [2023-02-14 22:59:41,697 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,697 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 238 treesize of output 1 [2023-02-14 22:59:41,703 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,704 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 1 [2023-02-14 22:59:41,710 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,710 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-02-14 22:59:41,717 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,717 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 1 [2023-02-14 22:59:41,722 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,722 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 1 [2023-02-14 22:59:41,727 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:59:41,727 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 395 treesize of output 1 [2023-02-14 22:59:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-02-14 22:59:41,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835979748] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:41,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:41,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 36 [2023-02-14 22:59:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603707337] [2023-02-14 22:59:41,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:41,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-14 22:59:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:41,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-14 22:59:41,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1067, Unknown=1, NotChecked=66, Total=1260 [2023-02-14 22:59:41,740 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 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-14 22:59:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:59:44,169 INFO L93 Difference]: Finished difference Result 200 states and 243 transitions. [2023-02-14 22:59:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-14 22:59:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 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) Word has length 51 [2023-02-14 22:59:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:59:44,170 INFO L225 Difference]: With dead ends: 200 [2023-02-14 22:59:44,170 INFO L226 Difference]: Without dead ends: 129 [2023-02-14 22:59:44,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=523, Invalid=4172, Unknown=1, NotChecked=134, Total=4830 [2023-02-14 22:59:44,172 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 248 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 22:59:44,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1008 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 813 Invalid, 0 Unknown, 96 Unchecked, 0.8s Time] [2023-02-14 22:59:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-14 22:59:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2023-02-14 22:59:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 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-14 22:59:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2023-02-14 22:59:44,180 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 51 [2023-02-14 22:59:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:59:44,180 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2023-02-14 22:59:44,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 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-14 22:59:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2023-02-14 22:59:44,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 22:59:44,181 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:59:44,181 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:59:44,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 22:59:44,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:44,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:59:44,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:59:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1013477057, now seen corresponding path program 6 times [2023-02-14 22:59:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:59:44,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030067642] [2023-02-14 22:59:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:59:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:59:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:59:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:46,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:59:46,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030067642] [2023-02-14 22:59:46,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030067642] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:59:46,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603035199] [2023-02-14 22:59:46,537 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 22:59:46,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:59:46,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:59:46,538 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:59:46,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 22:59:46,968 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-02-14 22:59:46,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:59:46,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 106 conjunts are in the unsatisfiable core [2023-02-14 22:59:46,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:59:46,987 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-14 22:59:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:46,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:46,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 22:59:47,052 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 11 treesize of output 7 [2023-02-14 22:59:47,071 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 22:59:47,071 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 21 treesize of output 29 [2023-02-14 22:59:47,076 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 32 treesize of output 28 [2023-02-14 22:59:47,081 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 11 treesize of output 7 [2023-02-14 22:59:47,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:47,165 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:47,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,170 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 16 treesize of output 18 [2023-02-14 22:59:47,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,174 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 59 treesize of output 49 [2023-02-14 22:59:47,192 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 22:59:47,193 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 1 case distinctions, treesize of input 40 treesize of output 44 [2023-02-14 22:59:47,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,218 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 22:59:47,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 22:59:47,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:47,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 22:59:47,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,356 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 22:59:47,356 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2023-02-14 22:59:47,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,362 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 33 treesize of output 38 [2023-02-14 22:59:47,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:47,371 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-02-14 22:59:47,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-02-14 22:59:47,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-02-14 22:59:48,370 INFO L321 Elim1Store]: treesize reduction 276, result has 35.7 percent of original size [2023-02-14 22:59:48,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 281 [2023-02-14 22:59:48,505 INFO L321 Elim1Store]: treesize reduction 208, result has 43.0 percent of original size [2023-02-14 22:59:48,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 145 treesize of output 255 [2023-02-14 22:59:53,549 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 22:59:53,549 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 22:59:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:59:53,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:59:54,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:54,023 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2023-02-14 22:59:54,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:54,028 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2023-02-14 22:59:54,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_40| Int) (v_ArrVal_921 (Array Int Int)) (v_arrayElimArr_60 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_61)) (.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_60))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~l~0#1.base_40| v_ArrVal_921) (select (select .cse5 .cse3) .cse4))) (.cse1 (select (select .cse2 .cse3) .cse4))) (or (not (= (select v_arrayElimArr_61 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_60 0))) (not (= (select .cse0 (+ 8 .cse1)) 3)) (not (= (select .cse0 (+ .cse1 4)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~l~0#1.base_40|) 0))))))) is different from false [2023-02-14 22:59:54,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:54,097 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 221 [2023-02-14 22:59:54,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:54,103 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 203 [2023-02-14 22:59:54,124 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~l~0#1.base_40| Int) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (v_arrayElimArr_60 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int)) (v_arrayElimArr_63 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_60 0))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_62) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_61)) (.cse6 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_63) |v_ULTIMATE.start_main_~l~0#1.base_40| v_arrayElimArr_60))) (let ((.cse4 (select (select .cse6 .cse0) 0)) (.cse5 (select (select .cse3 .cse0) 0))) (let ((.cse1 (select (store (store |c_#memory_int| .cse0 v_ArrVal_914) |v_ULTIMATE.start_main_~l~0#1.base_40| v_ArrVal_921) (select (select .cse6 .cse4) .cse5))) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_40|) 0)) (not (= (select .cse1 (+ .cse2 4)) 1)) (not (= (select v_arrayElimArr_61 0) 0)) (not (= (select |c_#valid| .cse0) 0)) (not (= 3 (select .cse1 (+ .cse2 8)))) (not (= (select v_arrayElimArr_62 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select v_arrayElimArr_63 0) |c_ULTIMATE.start_main_~l~0#1.base|)))))))) is different from false [2023-02-14 22:59:54,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:54,227 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 303 [2023-02-14 22:59:54,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:59:54,234 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 219 [2023-02-14 22:59:54,237 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:54,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:54,239 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:54,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:59:54,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 107 [2023-02-14 22:59:54,251 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:59:54,253 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 329 treesize of output 305 [2023-02-14 22:59:54,256 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 284 [2023-02-14 22:59:54,260 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 234 [2023-02-14 22:59:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2023-02-14 22:59:54,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603035199] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:59:54,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:59:54,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 39 [2023-02-14 22:59:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074171627] [2023-02-14 22:59:54,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:59:54,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-14 22:59:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:59:54,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-14 22:59:54,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1234, Unknown=2, NotChecked=142, Total=1482 [2023-02-14 22:59:54,564 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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-14 23:00:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 23:00:14,129 INFO L93 Difference]: Finished difference Result 351 states and 426 transitions. [2023-02-14 23:00:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-02-14 23:00:14,129 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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 56 [2023-02-14 23:00:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 23:00:14,131 INFO L225 Difference]: With dead ends: 351 [2023-02-14 23:00:14,131 INFO L226 Difference]: Without dead ends: 311 [2023-02-14 23:00:14,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5106 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=3832, Invalid=13730, Unknown=2, NotChecked=526, Total=18090 [2023-02-14 23:00:14,138 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2257 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 23:00:14,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 780 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 606 Invalid, 0 Unknown, 251 Unchecked, 0.9s Time] [2023-02-14 23:00:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-02-14 23:00:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 95. [2023-02-14 23:00:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 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-14 23:00:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2023-02-14 23:00:14,163 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 56 [2023-02-14 23:00:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 23:00:14,163 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2023-02-14 23:00:14,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.8205128205128207) internal successors, (149), 39 states have internal predecessors, (149), 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-14 23:00:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2023-02-14 23:00:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-14 23:00:14,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 23:00:14,164 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 23:00:14,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 23:00:14,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-14 23:00:14,371 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 23:00:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 23:00:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1512229753, now seen corresponding path program 3 times [2023-02-14 23:00:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 23:00:14,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057915186] [2023-02-14 23:00:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 23:00:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 23:00:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 23:00:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 23:00:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 23:00:15,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057915186] [2023-02-14 23:00:15,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057915186] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 23:00:15,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477294323] [2023-02-14 23:00:15,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 23:00:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 23:00:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 23:00:15,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 23:00:15,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 23:00:16,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-14 23:00:16,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 23:00:16,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-14 23:00:16,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 23:00:16,015 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-14 23:00:16,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 23:00:16,080 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 11 treesize of output 7 [2023-02-14 23:00:16,094 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 23:00:16,095 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 21 treesize of output 29 [2023-02-14 23:00:16,103 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 32 treesize of output 28 [2023-02-14 23:00:16,111 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 11 treesize of output 7 [2023-02-14 23:00:16,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:16,194 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:16,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,199 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 59 treesize of output 49 [2023-02-14 23:00:16,212 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-14 23:00:16,212 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 1 case distinctions, treesize of input 40 treesize of output 44 [2023-02-14 23:00:16,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,222 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 18 treesize of output 20 [2023-02-14 23:00:16,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,242 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 23:00:16,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 23:00:16,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:16,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:16,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,382 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 23:00:16,382 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2023-02-14 23:00:16,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,391 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 33 treesize of output 38 [2023-02-14 23:00:16,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:16,403 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-02-14 23:00:16,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-02-14 23:00:16,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-02-14 23:00:17,407 INFO L321 Elim1Store]: treesize reduction 236, result has 45.0 percent of original size [2023-02-14 23:00:17,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 297 treesize of output 321 [2023-02-14 23:00:17,641 INFO L321 Elim1Store]: treesize reduction 224, result has 38.6 percent of original size [2023-02-14 23:00:17,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 193 treesize of output 275 [2023-02-14 23:00:26,803 INFO L321 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2023-02-14 23:00:26,804 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 40 [2023-02-14 23:00:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 23:00:26,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 23:00:27,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:27,041 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 135 [2023-02-14 23:00:27,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:27,046 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 117 [2023-02-14 23:00:27,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:27,168 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 221 [2023-02-14 23:00:27,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:27,173 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 203 [2023-02-14 23:00:27,197 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_71 (Array Int Int)) (v_arrayElimArr_70 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_47| Int) (v_ArrVal_1087 (Array Int Int)) (v_arrayElimArr_73 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_arrayElimArr_72 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_70 0))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_arrayElimArr_72) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_71)) (.cse6 (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_73) |v_ULTIMATE.start_main_~l~0#1.base_47| v_arrayElimArr_70))) (let ((.cse4 (select (select .cse6 .cse0) 0)) (.cse5 (select (select .cse3 .cse0) 0))) (let ((.cse1 (select (store (store |c_#memory_int| .cse0 v_ArrVal_1087) |v_ULTIMATE.start_main_~l~0#1.base_47| v_ArrVal_1097) (select (select .cse6 .cse4) .cse5))) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select v_arrayElimArr_73 0) |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_71 0) 0)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~l~0#1.base_47|) 0)) (not (= (select .cse1 (+ .cse2 8)) 2)) (not (= (select .cse1 (+ .cse2 4)) 0)) (not (= (select v_arrayElimArr_72 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)))))))) is different from false [2023-02-14 23:00:27,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:27,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 375 treesize of output 303 [2023-02-14 23:00:27,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:27,313 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 219 [2023-02-14 23:00:27,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:27,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:27,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:27,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:27,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 107 [2023-02-14 23:00:27,322 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:27,324 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 329 treesize of output 305 [2023-02-14 23:00:27,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 284 [2023-02-14 23:00:27,328 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 234 [2023-02-14 23:00:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-02-14 23:00:27,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477294323] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 23:00:27,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 23:00:27,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 32 [2023-02-14 23:00:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864597013] [2023-02-14 23:00:27,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 23:00:27,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 23:00:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 23:00:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 23:00:27,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=842, Unknown=2, NotChecked=58, Total=992 [2023-02-14 23:00:27,625 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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-14 23:00:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 23:00:39,255 INFO L93 Difference]: Finished difference Result 251 states and 302 transitions. [2023-02-14 23:00:39,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-02-14 23:00:39,255 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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 58 [2023-02-14 23:00:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 23:00:39,256 INFO L225 Difference]: With dead ends: 251 [2023-02-14 23:00:39,257 INFO L226 Difference]: Without dead ends: 249 [2023-02-14 23:00:39,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3034 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=2464, Invalid=8250, Unknown=2, NotChecked=204, Total=10920 [2023-02-14 23:00:39,260 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1379 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 23:00:39,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 541 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 568 Invalid, 0 Unknown, 102 Unchecked, 0.9s Time] [2023-02-14 23:00:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-14 23:00:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 106. [2023-02-14 23:00:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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-14 23:00:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2023-02-14 23:00:39,293 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 58 [2023-02-14 23:00:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 23:00:39,294 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2023-02-14 23:00:39,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.625) internal successors, (148), 32 states have internal predecessors, (148), 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-14 23:00:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2023-02-14 23:00:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-14 23:00:39,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 23:00:39,302 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 23:00:39,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-14 23:00:39,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 23:00:39,510 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 23:00:39,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 23:00:39,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1492842773, now seen corresponding path program 7 times [2023-02-14 23:00:39,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 23:00:39,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313878280] [2023-02-14 23:00:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 23:00:39,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 23:00:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 23:00:40,607 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 23:00:40,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 23:00:40,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313878280] [2023-02-14 23:00:40,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313878280] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 23:00:40,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114371909] [2023-02-14 23:00:40,607 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 23:00:40,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 23:00:40,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 23:00:40,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 23:00:40,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 23:00:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 23:00:40,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-14 23:00:40,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 23:00:40,820 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 11 treesize of output 7 [2023-02-14 23:00:40,823 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 11 treesize of output 7 [2023-02-14 23:00:40,825 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-14 23:00:40,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:40,899 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:40,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:40,903 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 16 treesize of output 18 [2023-02-14 23:00:40,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:40,907 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 16 treesize of output 18 [2023-02-14 23:00:40,921 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 23:00:40,921 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 21 treesize of output 29 [2023-02-14 23:00:41,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:41,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:41,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,023 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 23:00:41,023 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2023-02-14 23:00:41,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,036 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 23:00:41,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 23:00:41,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,049 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 33 treesize of output 38 [2023-02-14 23:00:41,150 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:41,154 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:00:41,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,173 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-02-14 23:00:41,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 116 treesize of output 86 [2023-02-14 23:00:41,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,187 INFO L321 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2023-02-14 23:00:41,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 76 [2023-02-14 23:00:41,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:41,207 INFO L321 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2023-02-14 23:00:41,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2023-02-14 23:00:42,277 INFO L321 Elim1Store]: treesize reduction 194, result has 10.2 percent of original size [2023-02-14 23:00:42,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 251 treesize of output 121 [2023-02-14 23:00:42,297 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2023-02-14 23:00:42,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2023-02-14 23:00:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 23:00:42,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 23:00:42,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:42,393 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 133 [2023-02-14 23:00:42,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:42,398 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 112 [2023-02-14 23:00:42,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:42,565 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 219 [2023-02-14 23:00:42,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:42,571 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 198 [2023-02-14 23:00:42,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:42,933 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 363 treesize of output 349 [2023-02-14 23:00:42,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:42,940 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 328 [2023-02-14 23:00:43,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:43,507 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 189 [2023-02-14 23:00:43,509 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:43,510 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:43,515 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-14 23:00:43,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2760 treesize of output 2680 [2023-02-14 23:00:43,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:43,522 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2676 treesize of output 1750 [2023-02-14 23:00:43,525 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:43,526 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:43,526 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:43,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3820 treesize of output 3622 [2023-02-14 23:00:43,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3670 treesize of output 2608 [2023-02-14 23:00:43,548 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 1288 treesize of output 1190 [2023-02-14 23:00:43,553 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2472 treesize of output 2278 [2023-02-14 23:00:43,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,557 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2320 treesize of output 2158 [2023-02-14 23:00:43,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:43,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2149 treesize of output 1681 [2023-02-14 23:00:43,571 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 23:00:43,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2023-02-14 23:00:46,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:46,617 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 177 [2023-02-14 23:00:46,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:46,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:46,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:46,677 INFO L321 Elim1Store]: treesize reduction 765, result has 3.2 percent of original size [2023-02-14 23:00:46,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 646226 treesize of output 591720 [2023-02-14 23:00:46,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 23:00:46,704 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 591688 treesize of output 395882 [2023-02-14 23:00:46,714 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,715 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,720 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 60124 treesize of output 60118 [2023-02-14 23:00:46,734 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60166 treesize of output 43904 [2023-02-14 23:00:46,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:46,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:00:46,753 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-02-14 23:00:46,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43876 treesize of output 36198 [2023-02-14 23:00:46,763 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 27968 treesize of output 24830 [2023-02-14 23:00:46,788 INFO L321 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2023-02-14 23:00:46,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 24796 treesize of output 22388 [2023-02-14 23:00:46,800 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 23:00:46,801 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 14908 treesize of output 14274 [2023-02-14 23:00:46,804 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 6757 treesize of output 6081 [2023-02-14 23:00:46,807 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,807 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 23:00:46,815 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-14 23:00:46,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2023-02-14 23:02:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 23:02:03,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114371909] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 23:02:03,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 23:02:03,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2023-02-14 23:02:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666890965] [2023-02-14 23:02:03,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 23:02:03,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 23:02:03,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 23:02:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 23:02:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2023-02-14 23:02:03,453 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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-14 23:02:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 23:02:04,889 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2023-02-14 23:02:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 23:02:04,890 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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 64 [2023-02-14 23:02:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 23:02:04,890 INFO L225 Difference]: With dead ends: 213 [2023-02-14 23:02:04,890 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 23:02:04,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2023-02-14 23:02:04,891 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 23:02:04,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1124 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-14 23:02:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 23:02:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2023-02-14 23:02:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3) internal successors, (143), 110 states have internal predecessors, (143), 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-14 23:02:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 143 transitions. [2023-02-14 23:02:04,907 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 143 transitions. Word has length 64 [2023-02-14 23:02:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 23:02:04,907 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 143 transitions. [2023-02-14 23:02:04,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.269230769230769) internal successors, (137), 26 states have internal predecessors, (137), 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-14 23:02:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 143 transitions. [2023-02-14 23:02:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-14 23:02:04,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 23:02:04,908 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 23:02:04,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 23:02:05,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-14 23:02:05,114 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 23:02:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 23:02:05,114 INFO L85 PathProgramCache]: Analyzing trace with hash -377962859, now seen corresponding path program 8 times [2023-02-14 23:02:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 23:02:05,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845830203] [2023-02-14 23:02:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 23:02:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 23:02:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 23:02:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 23 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 23:02:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 23:02:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845830203] [2023-02-14 23:02:06,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845830203] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 23:02:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257602536] [2023-02-14 23:02:06,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 23:02:06,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 23:02:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 23:02:06,693 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 23:02:06,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 23:02:06,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 23:02:06,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 23:02:06,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 134 conjunts are in the unsatisfiable core [2023-02-14 23:02:06,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 23:02:06,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:06,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:06,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-14 23:02:06,888 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-14 23:02:06,971 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 11 treesize of output 7 [2023-02-14 23:02:06,977 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 11 treesize of output 7 [2023-02-14 23:02:06,990 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 23:02:06,990 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 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-14 23:02:07,014 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 23:02:07,014 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 21 treesize of output 29 [2023-02-14 23:02:07,133 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:02:07,138 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:02:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,143 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 59 treesize of output 49 [2023-02-14 23:02:07,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,147 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 18 treesize of output 20 [2023-02-14 23:02:07,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,168 INFO L321 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2023-02-14 23:02:07,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2023-02-14 23:02:07,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2023-02-14 23:02:07,321 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:02:07,327 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:02:07,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,341 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-14 23:02:07,341 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 83 [2023-02-14 23:02:07,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,362 INFO L321 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2023-02-14 23:02:07,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 73 [2023-02-14 23:02:07,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,380 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 33 treesize of output 38 [2023-02-14 23:02:07,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-02-14 23:02:07,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:02:07,670 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-14 23:02:07,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,698 INFO L321 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-02-14 23:02:07,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 117 [2023-02-14 23:02:07,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2023-02-14 23:02:07,742 INFO L321 Elim1Store]: treesize reduction 43, result has 48.8 percent of original size [2023-02-14 23:02:07,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2023-02-14 23:02:07,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 23:02:07,775 INFO L321 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2023-02-14 23:02:07,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 36 [2023-02-14 23:02:10,520 INFO L321 Elim1Store]: treesize reduction 416, result has 54.4 percent of original size [2023-02-14 23:02:10,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 23 new quantified variables, introduced 78 case distinctions, treesize of input 495 treesize of output 689 [2023-02-14 23:02:11,082 INFO L321 Elim1Store]: treesize reduction 364, result has 55.4 percent of original size [2023-02-14 23:02:11,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 17 new quantified variables, introduced 78 case distinctions, treesize of input 575 treesize of output 811