/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 04:51:06,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 04:51:06,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 04:51:06,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 04:51:06,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 04:51:06,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 04:51:06,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 04:51:06,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 04:51:06,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 04:51:06,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 04:51:06,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 04:51:06,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 04:51:06,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 04:51:06,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 04:51:06,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 04:51:06,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 04:51:06,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 04:51:06,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 04:51:06,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 04:51:06,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 04:51:06,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 04:51:06,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 04:51:06,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 04:51:06,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 04:51:06,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 04:51:06,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 04:51:06,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 04:51:06,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 04:51:06,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 04:51:06,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 04:51:06,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 04:51:06,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 04:51:06,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 04:51:06,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 04:51:06,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 04:51:06,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 04:51:06,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 04:51:06,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 04:51:06,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 04:51:06,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 04:51:06,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 04:51:06,168 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 04:51:06,193 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 04:51:06,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 04:51:06,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 04:51:06,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 04:51:06,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 04:51:06,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 04:51:06,195 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 04:51:06,195 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 04:51:06,195 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 04:51:06,195 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 04:51:06,196 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 04:51:06,196 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 04:51:06,196 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 04:51:06,196 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 04:51:06,196 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 04:51:06,196 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 04:51:06,196 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 04:51:06,197 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 04:51:06,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 04:51:06,198 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 04:51:06,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 04:51:06,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 04:51:06,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 04:51:06,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 04:51:06,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 04:51:06,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 04:51:06,199 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 04:51:06,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 04:51:06,199 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 04:51:06,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 04:51:06,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 04:51:06,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 04:51:06,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:51:06,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 04:51:06,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-01 04:51:06,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 04:51:06,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 04:51:06,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 04:51:06,469 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 04:51:06,470 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 04:51:06,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2023-04-01 04:51:07,661 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 04:51:07,938 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 04:51:07,938 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2023-04-01 04:51:07,961 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2f25e343/07ce086916d04f468917109b4d34b264/FLAGbb5415524 [2023-04-01 04:51:07,972 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2f25e343/07ce086916d04f468917109b4d34b264 [2023-04-01 04:51:07,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 04:51:07,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 04:51:07,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 04:51:07,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 04:51:07,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 04:51:07,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:51:07" (1/1) ... [2023-04-01 04:51:07,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4314a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:07, skipping insertion in model container [2023-04-01 04:51:07,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 04:51:07" (1/1) ... [2023-04-01 04:51:07,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 04:51:08,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 04:51:08,163 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-04-01 04:51:08,167 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-04-01 04:51:08,168 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-04-01 04:51:08,168 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-04-01 04:51:08,169 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-04-01 04:51:08,170 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-04-01 04:51:08,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:51:08,178 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 04:51:08,205 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2023-04-01 04:51:08,207 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2023-04-01 04:51:08,207 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2023-04-01 04:51:08,208 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2023-04-01 04:51:08,221 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2023-04-01 04:51:08,222 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2023-04-01 04:51:08,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 04:51:08,242 INFO L208 MainTranslator]: Completed translation [2023-04-01 04:51:08,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08 WrapperNode [2023-04-01 04:51:08,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 04:51:08,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 04:51:08,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 04:51:08,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 04:51:08,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 04:51:08,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 04:51:08,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 04:51:08,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 04:51:08,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (1/1) ... [2023-04-01 04:51:08,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 04:51:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:51:08,325 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-04-01 04:51:08,329 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-04-01 04:51:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 04:51:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 04:51:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 04:51:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 04:51:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-01 04:51:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-01 04:51:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-01 04:51:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-01 04:51:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-01 04:51:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-01 04:51:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-01 04:51:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-01 04:51:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-01 04:51:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 04:51:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 04:51:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 04:51:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 04:51:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 04:51:08,526 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 04:51:08,528 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 04:51:08,715 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 04:51:08,726 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 04:51:08,727 INFO L302 CfgBuilder]: Removed 15 assume(true) statements. [2023-04-01 04:51:08,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:51:08 BoogieIcfgContainer [2023-04-01 04:51:08,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 04:51:08,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 04:51:08,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 04:51:08,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 04:51:08,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 04:51:07" (1/3) ... [2023-04-01 04:51:08,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9ad83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:51:08, skipping insertion in model container [2023-04-01 04:51:08,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 04:51:08" (2/3) ... [2023-04-01 04:51:08,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9ad83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 04:51:08, skipping insertion in model container [2023-04-01 04:51:08,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 04:51:08" (3/3) ... [2023-04-01 04:51:08,734 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2023-04-01 04:51:08,748 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 04:51:08,748 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-04-01 04:51:08,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 04:51:08,786 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=FINITE_AUTOMATA, 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;@78e4cda7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 04:51:08,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-04-01 04:51:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 42 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 04:51:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-04-01 04:51:08,794 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:08,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:08,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:08,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1346572805, now seen corresponding path program 1 times [2023-04-01 04:51:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967166610] [2023-04-01 04:51:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:09,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967166610] [2023-04-01 04:51:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967166610] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:09,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:09,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 04:51:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460723025] [2023-04-01 04:51:09,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:09,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 04:51:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 04:51:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 04:51:09,082 INFO L87 Difference]: Start difference. First operand has 47 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 42 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:09,104 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2023-04-01 04:51:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 04:51:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-04-01 04:51:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:09,111 INFO L225 Difference]: With dead ends: 89 [2023-04-01 04:51:09,111 INFO L226 Difference]: Without dead ends: 42 [2023-04-01 04:51:09,113 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-04-01 04:51:09,115 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:09,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:51:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-04-01 04:51:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-04-01 04:51:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 38 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2023-04-01 04:51:09,139 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 9 [2023-04-01 04:51:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:09,139 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-04-01 04:51:09,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2023-04-01 04:51:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-04-01 04:51:09,140 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:09,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:09,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 04:51:09,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:09,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1345806184, now seen corresponding path program 1 times [2023-04-01 04:51:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981618764] [2023-04-01 04:51:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:09,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981618764] [2023-04-01 04:51:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981618764] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 04:51:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261952294] [2023-04-01 04:51:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:09,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 04:51:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 04:51:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 04:51:09,671 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:09,734 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2023-04-01 04:51:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 04:51:09,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-04-01 04:51:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:09,735 INFO L225 Difference]: With dead ends: 42 [2023-04-01 04:51:09,736 INFO L226 Difference]: Without dead ends: 40 [2023-04-01 04:51:09,737 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-04-01 04:51:09,740 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:09,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:51:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-04-01 04:51:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-04-01 04:51:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-04-01 04:51:09,753 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 9 [2023-04-01 04:51:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:09,753 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-04-01 04:51:09,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-04-01 04:51:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-04-01 04:51:09,754 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:09,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:09,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 04:51:09,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:09,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1229724763, now seen corresponding path program 1 times [2023-04-01 04:51:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:09,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053073121] [2023-04-01 04:51:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:09,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053073121] [2023-04-01 04:51:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053073121] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:09,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:09,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 04:51:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482617850] [2023-04-01 04:51:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:09,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 04:51:09,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:09,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 04:51:09,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 04:51:09,868 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:09,935 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2023-04-01 04:51:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 04:51:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-04-01 04:51:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:09,937 INFO L225 Difference]: With dead ends: 66 [2023-04-01 04:51:09,937 INFO L226 Difference]: Without dead ends: 64 [2023-04-01 04:51:09,938 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-04-01 04:51:09,939 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:09,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 54 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:51:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-01 04:51:09,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2023-04-01 04:51:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-04-01 04:51:09,943 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 10 [2023-04-01 04:51:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:09,944 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-04-01 04:51:09,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-04-01 04:51:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-01 04:51:09,944 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:09,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:09,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 04:51:09,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:09,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -638342380, now seen corresponding path program 1 times [2023-04-01 04:51:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659019220] [2023-04-01 04:51:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:10,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:10,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659019220] [2023-04-01 04:51:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659019220] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:10,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 04:51:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743268738] [2023-04-01 04:51:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:10,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 04:51:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 04:51:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 04:51:10,042 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:10,108 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2023-04-01 04:51:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:51:10,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-01 04:51:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:10,109 INFO L225 Difference]: With dead ends: 38 [2023-04-01 04:51:10,109 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 04:51:10,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 04:51:10,114 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:10,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 101 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:51:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 04:51:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 04:51:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-04-01 04:51:10,124 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 15 [2023-04-01 04:51:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:10,124 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-04-01 04:51:10,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-04-01 04:51:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-01 04:51:10,125 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:10,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:10,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 04:51:10,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:10,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -638304644, now seen corresponding path program 1 times [2023-04-01 04:51:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:10,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075917524] [2023-04-01 04:51:10,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:10,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075917524] [2023-04-01 04:51:10,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075917524] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:10,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:10,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 04:51:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700220277] [2023-04-01 04:51:10,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:10,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 04:51:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 04:51:10,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-04-01 04:51:10,909 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:11,090 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2023-04-01 04:51:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 04:51:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-04-01 04:51:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:11,093 INFO L225 Difference]: With dead ends: 53 [2023-04-01 04:51:11,093 INFO L226 Difference]: Without dead ends: 51 [2023-04-01 04:51:11,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-04-01 04:51:11,094 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:11,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 107 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:51:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-04-01 04:51:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-04-01 04:51:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-04-01 04:51:11,105 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2023-04-01 04:51:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:11,105 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-04-01 04:51:11,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-04-01 04:51:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 04:51:11,107 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:11,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:11,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 04:51:11,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:11,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash 447333244, now seen corresponding path program 1 times [2023-04-01 04:51:11,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:11,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629293484] [2023-04-01 04:51:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:11,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:12,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629293484] [2023-04-01 04:51:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629293484] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 04:51:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137475728] [2023-04-01 04:51:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:12,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 04:51:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:12,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 04:51:12,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 04:51:12,462 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:12,571 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2023-04-01 04:51:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 04:51:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-04-01 04:51:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:12,572 INFO L225 Difference]: With dead ends: 69 [2023-04-01 04:51:12,572 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 04:51:12,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 04:51:12,572 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:12,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 149 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:51:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 04:51:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2023-04-01 04:51:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-04-01 04:51:12,578 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 19 [2023-04-01 04:51:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:12,579 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-04-01 04:51:12,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2023-04-01 04:51:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 04:51:12,579 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:12,579 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:12,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-04-01 04:51:12,579 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:12,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:12,580 INFO L85 PathProgramCache]: Analyzing trace with hash 111973989, now seen corresponding path program 1 times [2023-04-01 04:51:12,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267182706] [2023-04-01 04:51:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:13,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267182706] [2023-04-01 04:51:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267182706] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:51:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174777194] [2023-04-01 04:51:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:51:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:51:13,313 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-04-01 04:51:13,315 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-04-01 04:51:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:13,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-01 04:51:13,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:51:13,583 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-04-01 04:51:13,588 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-04-01 04:51:13,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:13,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-04-01 04:51:13,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:13,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:13,669 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:51:13,670 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 17 treesize of output 16 [2023-04-01 04:51:13,678 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 0 case distinctions, treesize of input 18 treesize of output 18 [2023-04-01 04:51:13,685 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 50 treesize of output 30 [2023-04-01 04:51:13,691 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 18 treesize of output 16 [2023-04-01 04:51:13,707 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-01 04:51:13,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-01 04:51:13,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:13,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:13,820 INFO L321 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2023-04-01 04:51:13,821 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 3 case distinctions, treesize of input 35 treesize of output 36 [2023-04-01 04:51:13,835 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-04-01 04:51:13,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-04-01 04:51:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:13,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:51:13,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:13,885 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 33 treesize of output 34 [2023-04-01 04:51:13,893 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 71 treesize of output 51 [2023-04-01 04:51:13,897 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 24 treesize of output 22 [2023-04-01 04:51:14,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:14,125 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 231 treesize of output 192 [2023-04-01 04:51:14,132 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 403 treesize of output 307 [2023-04-01 04:51:14,139 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 268 treesize of output 256 [2023-04-01 04:51:20,620 WARN L223 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 183 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 04:51:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174777194] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:51:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [587514959] [2023-04-01 04:51:20,675 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 04:51:20,675 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:51:20,677 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:51:20,680 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:51:20,680 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:51:20,715 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:51:22,975 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:51:22,979 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:51:24,313 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1023#(and (exists ((|v_#memory_int_21| (Array Int (Array Int Int))) (|v_#memory_int_22| (Array Int (Array Int Int))) (v_main_~x~0.base_33 Int) (|v_#memory_$Pointer$.base_16| (Array Int (Array Int Int))) (v_main_~x~0.offset_32 Int) (|v_#memory_$Pointer$.base_37| (Array Int (Array Int Int))) (|v_#length_18| (Array Int Int)) (|v_#memory_$Pointer$.offset_34| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_16| (Array Int (Array Int Int))) (|v_#valid_29| (Array Int Int)) (|v_main_#t~malloc6.base_3| Int) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32) (store (select |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_32)) v_main_~x~0.base_33) v_main_~x~0.offset_32) 8) 2))) (= |#memory_$Pointer$.base| (store (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32) (store (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_32)) v_main_~x~0.base_33) v_main_~x~0.offset_32) 8) (select (select |#memory_$Pointer$.base| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_32)) v_main_~x~0.base_33) v_main_~x~0.offset_32) 8))))) (= (store |v_#memory_$Pointer$.offset_34| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_34| v_main_~x~0.base_33) (+ 8 v_main_~x~0.offset_32) (select (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) (+ 8 v_main_~x~0.offset_32)))) |v_#memory_$Pointer$.offset_16|) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_32)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32) (store (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_32)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_32)) v_main_~x~0.base_33) v_main_~x~0.offset_32) 8) (select (select |#memory_$Pointer$.offset| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_33)) v_main_~x~0.base_33) v_main_~x~0.offset_32)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_33) v_main_~x~0.offset_32 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_32)) v_main_~x~0.base_33) v_main_~x~0.offset_32) 8))))) (= (store |v_#length_18| |v_main_#t~malloc6.base_3| 12) |#length|) (= (store |v_#valid_29| |v_main_#t~malloc6.base_3| 1) |#valid|) (not (= 0 |v_main_#t~malloc6.base_3|)) (< |v_main_#t~malloc6.base_3| |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_37| v_main_~x~0.base_33 (store (select |v_#memory_$Pointer$.base_37| v_main_~x~0.base_33) (+ 8 v_main_~x~0.offset_32) (select (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_33) (+ 8 v_main_~x~0.offset_32)))) |v_#memory_$Pointer$.base_16|) (= (store |v_#memory_int_22| |v_main_#t~malloc6.base_3| (store (select |v_#memory_int_22| |v_main_#t~malloc6.base_3|) 4 (select (select |v_#memory_int_21| |v_main_#t~malloc6.base_3|) 4))) |v_#memory_int_21|) (= (select |v_#valid_29| |v_main_#t~malloc6.base_3|) 0) (= |v_#memory_int_22| (store |v_#memory_int_82| v_main_~x~0.base_33 (store (store (select |v_#memory_int_82| v_main_~x~0.base_33) (+ 8 v_main_~x~0.offset_32) 1) v_main_~x~0.offset_32 (select (select |v_#memory_int_22| v_main_~x~0.base_33) v_main_~x~0.offset_32)))))) (<= 1 |#StackHeapBarrier|) (not (= main_~x~0.base 0)) (= main_~head~0.offset 0) (= main_~x~0.offset 0) (<= (+ main_~head~0.base 1) |#StackHeapBarrier|) (not (= 1 (select (select |#memory_int| main_~x~0.base) 8))) (= main_~head~0.base main_~x~0.base) (= |#NULL.offset| 0) (not (= 0 (select (select |#memory_int| main_~x~0.base) 8))) (= |#NULL.base| 0))' at error location [2023-04-01 04:51:24,313 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:51:24,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:51:24,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-04-01 04:51:24,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967122427] [2023-04-01 04:51:24,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:51:24,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 04:51:24,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:24,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 04:51:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=500, Unknown=1, NotChecked=0, Total=600 [2023-04-01 04:51:24,314 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:24,538 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2023-04-01 04:51:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:51:24,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-04-01 04:51:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:24,539 INFO L225 Difference]: With dead ends: 63 [2023-04-01 04:51:24,539 INFO L226 Difference]: Without dead ends: 61 [2023-04-01 04:51:24,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=123, Invalid=632, Unknown=1, NotChecked=0, Total=756 [2023-04-01 04:51:24,540 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:24,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 195 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 04:51:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-01 04:51:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2023-04-01 04:51:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-04-01 04:51:24,545 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 19 [2023-04-01 04:51:24,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:24,545 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-04-01 04:51:24,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:24,545 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-04-01 04:51:24,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 04:51:24,546 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:24,546 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:24,559 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-04-01 04:51:24,762 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-04-01 04:51:24,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:24,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1603992565, now seen corresponding path program 1 times [2023-04-01 04:51:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:24,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341617646] [2023-04-01 04:51:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:25,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:25,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341617646] [2023-04-01 04:51:25,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341617646] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:25,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:25,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 04:51:25,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254139819] [2023-04-01 04:51:25,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:25,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 04:51:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:25,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 04:51:25,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-04-01 04:51:25,193 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:25,344 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2023-04-01 04:51:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:51:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-04-01 04:51:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:25,346 INFO L225 Difference]: With dead ends: 79 [2023-04-01 04:51:25,346 INFO L226 Difference]: Without dead ends: 53 [2023-04-01 04:51:25,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-04-01 04:51:25,348 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:25,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 152 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 04:51:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-04-01 04:51:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-04-01 04:51:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-04-01 04:51:25,361 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 21 [2023-04-01 04:51:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:25,361 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-04-01 04:51:25,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-04-01 04:51:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 04:51:25,366 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:25,366 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:25,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-01 04:51:25,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:25,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:25,367 INFO L85 PathProgramCache]: Analyzing trace with hash 36830949, now seen corresponding path program 1 times [2023-04-01 04:51:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49737977] [2023-04-01 04:51:25,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:25,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49737977] [2023-04-01 04:51:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49737977] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:51:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234630183] [2023-04-01 04:51:25,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:25,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:51:25,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:51:25,965 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-04-01 04:51:25,966 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-04-01 04:51:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:26,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 48 conjunts are in the unsatisfiable core [2023-04-01 04:51:26,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:51:26,170 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-04-01 04:51:26,173 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-04-01 04:51:26,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:26,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-04-01 04:51:26,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:26,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 04:51:26,226 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 17 treesize of output 16 [2023-04-01 04:51:26,230 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 0 case distinctions, treesize of input 18 treesize of output 18 [2023-04-01 04:51:26,234 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 50 treesize of output 30 [2023-04-01 04:51:26,236 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 18 treesize of output 16 [2023-04-01 04:51:26,247 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-01 04:51:26,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-01 04:51:26,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:26,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:26,326 INFO L321 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2023-04-01 04:51:26,327 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 3 case distinctions, treesize of input 35 treesize of output 36 [2023-04-01 04:51:26,346 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-04-01 04:51:26,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-04-01 04:51:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:26,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:51:26,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:26,378 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 34 treesize of output 35 [2023-04-01 04:51:26,380 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 74 treesize of output 54 [2023-04-01 04:51:26,382 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 47 treesize of output 45 [2023-04-01 04:51:26,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:26,488 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 77 treesize of output 70 [2023-04-01 04:51:26,494 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 129 treesize of output 97 [2023-04-01 04:51:26,511 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 90 treesize of output 86 [2023-04-01 04:51:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:28,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234630183] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 04:51:28,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1651231661] [2023-04-01 04:51:28,999 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-04-01 04:51:29,000 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 04:51:29,000 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 04:51:29,000 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 04:51:29,000 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 04:51:29,017 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 24 for LOIs [2023-04-01 04:51:31,323 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 04:51:31,325 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 04:51:33,160 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1539#(and (<= 1 |#StackHeapBarrier|) (= main_~head~0.offset 0) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) 0)) (<= (+ main_~head~0.base 1) |#StackHeapBarrier|) (= (select (select |#memory_int| main_~head~0.base) 8) 1) (not (= main_~head~0.base 0)) (= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) 0) main_~x~0.base) (exists ((|v_#memory_int_21| (Array Int (Array Int Int))) (|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_22| (Array Int (Array Int Int))) (v_main_~x~0.base_42 Int) (|v_#memory_$Pointer$.base_16| (Array Int (Array Int Int))) (v_main_~x~0.offset_40 Int) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_44| (Array Int (Array Int Int))) (|v_#length_25| (Array Int Int)) (|v_#memory_$Pointer$.offset_16| (Array Int (Array Int Int))) (|v_#valid_38| (Array Int Int)) (|v_main_#t~malloc6.base_3| Int)) (and (= |#length| (store |v_#length_25| |v_main_#t~malloc6.base_3| 12)) (= (store |v_#valid_38| |v_main_#t~malloc6.base_3| 1) |#valid|) (= |#memory_$Pointer$.offset| (store (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_40)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40) (store (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_40)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_40)) v_main_~x~0.base_42) v_main_~x~0.offset_40) 8) (select (select |#memory_$Pointer$.offset| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_40)) v_main_~x~0.base_42) v_main_~x~0.offset_40) 8))))) (not (= 0 |v_main_#t~malloc6.base_3|)) (= |#memory_int| (store |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40) (store (select |v_#memory_int_21| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_40)) v_main_~x~0.base_42) v_main_~x~0.offset_40) 8) 2))) (< |v_main_#t~malloc6.base_3| |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.offset_44| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_44| v_main_~x~0.base_42) (+ 8 v_main_~x~0.offset_40) (select (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) (+ 8 v_main_~x~0.offset_40)))) |v_#memory_$Pointer$.offset_16|) (= (store |v_#memory_int_22| |v_main_#t~malloc6.base_3| (store (select |v_#memory_int_22| |v_main_#t~malloc6.base_3|) 4 (select (select |v_#memory_int_21| |v_main_#t~malloc6.base_3|) 4))) |v_#memory_int_21|) (= (store (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40) (store (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_40)) v_main_~x~0.base_42) v_main_~x~0.offset_40) 8) (select (select |#memory_$Pointer$.base| (select (select (store (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 |v_main_#t~malloc6.base_3|)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.base_42)) v_main_~x~0.base_42) v_main_~x~0.offset_40)) (+ (select (select (store (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3| (store (select (store |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.offset_16| v_main_~x~0.base_42) v_main_~x~0.offset_40 0)) |v_main_#t~malloc6.base_3|) 4 v_main_~x~0.offset_40)) v_main_~x~0.base_42) v_main_~x~0.offset_40) 8)))) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_48| v_main_~x~0.base_42 (store (select |v_#memory_$Pointer$.base_48| v_main_~x~0.base_42) (+ 8 v_main_~x~0.offset_40) (select (select |v_#memory_$Pointer$.base_16| v_main_~x~0.base_42) (+ 8 v_main_~x~0.offset_40)))) |v_#memory_$Pointer$.base_16|) (= |v_#memory_int_22| (store |v_#memory_int_114| v_main_~x~0.base_42 (store (store (select |v_#memory_int_114| v_main_~x~0.base_42) (+ 8 v_main_~x~0.offset_40) 1) v_main_~x~0.offset_40 (select (select |v_#memory_int_22| v_main_~x~0.base_42) v_main_~x~0.offset_40)))) (= (select |v_#valid_38| |v_main_#t~malloc6.base_3|) 0))) (not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2)) (= |#NULL.base| 0))' at error location [2023-04-01 04:51:33,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 04:51:33,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 04:51:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-04-01 04:51:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534625770] [2023-04-01 04:51:33,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 04:51:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 04:51:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 04:51:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=697, Unknown=4, NotChecked=0, Total=812 [2023-04-01 04:51:33,162 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:33,382 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2023-04-01 04:51:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:51:33,383 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-04-01 04:51:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:33,383 INFO L225 Difference]: With dead ends: 71 [2023-04-01 04:51:33,383 INFO L226 Difference]: Without dead ends: 55 [2023-04-01 04:51:33,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=137, Invalid=851, Unknown=4, NotChecked=0, Total=992 [2023-04-01 04:51:33,386 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:33,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 261 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 04:51:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-01 04:51:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-04-01 04:51:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2023-04-01 04:51:33,396 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 23 [2023-04-01 04:51:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:33,396 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2023-04-01 04:51:33,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2023-04-01 04:51:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-01 04:51:33,397 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:33,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:33,415 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-04-01 04:51:33,615 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,SelfDestructingSolverStorable8 [2023-04-01 04:51:33,615 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:33,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1377443731, now seen corresponding path program 1 times [2023-04-01 04:51:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922455873] [2023-04-01 04:51:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:33,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:33,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922455873] [2023-04-01 04:51:33,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922455873] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 04:51:33,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 04:51:33,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 04:51:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361087354] [2023-04-01 04:51:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 04:51:33,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 04:51:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 04:51:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 04:51:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 04:51:33,670 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 04:51:33,711 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2023-04-01 04:51:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 04:51:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-04-01 04:51:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 04:51:33,712 INFO L225 Difference]: With dead ends: 53 [2023-04-01 04:51:33,712 INFO L226 Difference]: Without dead ends: 34 [2023-04-01 04:51:33,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 04:51:33,712 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 04:51:33,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 04:51:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-01 04:51:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-04-01 04:51:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-04-01 04:51:33,715 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2023-04-01 04:51:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 04:51:33,715 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-04-01 04:51:33,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 04:51:33,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-04-01 04:51:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-01 04:51:33,715 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 04:51:33,716 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 04:51:33,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-01 04:51:33,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-04-01 04:51:33,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 04:51:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash -959706828, now seen corresponding path program 1 times [2023-04-01 04:51:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 04:51:33,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121314238] [2023-04-01 04:51:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 04:51:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:35,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 04:51:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121314238] [2023-04-01 04:51:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121314238] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 04:51:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027400722] [2023-04-01 04:51:35,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 04:51:35,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 04:51:35,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 04:51:35,624 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-04-01 04:51:35,625 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-04-01 04:51:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 04:51:35,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 81 conjunts are in the unsatisfiable core [2023-04-01 04:51:35,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 04:51:35,895 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-04-01 04:51:35,926 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 0 case distinctions, treesize of input 36 treesize of output 27 [2023-04-01 04:51:35,930 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 0 case distinctions, treesize of input 36 treesize of output 27 [2023-04-01 04:51:35,946 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-04-01 04:51:35,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2023-04-01 04:51:35,976 INFO L321 Elim1Store]: treesize reduction 45, result has 43.0 percent of original size [2023-04-01 04:51:35,976 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 2 case distinctions, treesize of input 51 treesize of output 72 [2023-04-01 04:51:35,981 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 5 treesize of output 3 [2023-04-01 04:51:35,985 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 5 treesize of output 3 [2023-04-01 04:51:35,992 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 5 treesize of output 3 [2023-04-01 04:51:35,998 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 5 treesize of output 3 [2023-04-01 04:51:36,016 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-04-01 04:51:36,017 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 25 treesize of output 29 [2023-04-01 04:51:36,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:36,199 INFO L321 Elim1Store]: treesize reduction 111, result has 22.9 percent of original size [2023-04-01 04:51:36,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 235 [2023-04-01 04:51:36,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:36,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:36,243 INFO L321 Elim1Store]: treesize reduction 55, result has 38.2 percent of original size [2023-04-01 04:51:36,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 140 [2023-04-01 04:51:36,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 60 [2023-04-01 04:51:36,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 04:51:36,276 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-04-01 04:51:36,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 86 [2023-04-01 04:51:36,301 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 91 treesize of output 81 [2023-04-01 04:51:36,310 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 33 treesize of output 35 [2023-04-01 04:51:36,319 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 43 treesize of output 35 [2023-04-01 04:51:36,347 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-04-01 04:51:36,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-04-01 04:51:36,392 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-04-01 04:51:36,393 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 3 case distinctions, treesize of input 35 treesize of output 21 [2023-04-01 04:51:36,409 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 159 treesize of output 147 [2023-04-01 04:51:36,571 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 40 treesize of output 24 [2023-04-01 04:51:36,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-04-01 04:51:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 04:51:36,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 04:51:36,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:36,649 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 96 treesize of output 94 [2023-04-01 04:51:36,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:36,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2023-04-01 04:51:36,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:36,669 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 431 treesize of output 430 [2023-04-01 04:51:36,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:36,676 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 426 treesize of output 420 [2023-04-01 04:51:36,684 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 349 treesize of output 287 [2023-04-01 04:51:36,697 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 158 treesize of output 127 [2023-04-01 04:51:36,752 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-04-01 04:51:36,761 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-04-01 04:51:41,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:41,063 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 1918 treesize of output 1535 [2023-04-01 04:51:41,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:41,098 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 1526 treesize of output 1079 [2023-04-01 04:51:41,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:41,372 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 80059 treesize of output 59286 [2023-04-01 04:51:43,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:43,033 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 51327 treesize of output 44478 [2023-04-01 04:51:44,824 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 17906 treesize of output 15770 [2023-04-01 04:51:45,082 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 15770 treesize of output 14554 [2023-04-01 04:51:45,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:45,293 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 14554 treesize of output 14515 [2023-04-01 04:51:45,428 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 14506 treesize of output 14470 [2023-04-01 04:51:45,565 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 14470 treesize of output 14420 [2023-04-01 04:51:45,716 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 14420 treesize of output 14408 [2023-04-01 04:51:45,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:45,915 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 14408 treesize of output 14369 [2023-04-01 04:51:46,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:46,103 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 14360 treesize of output 14181 [2023-04-01 04:51:46,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:46,361 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 14172 treesize of output 14181 [2023-04-01 04:51:46,519 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 14156 treesize of output 14144 [2023-04-01 04:51:46,673 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 14144 treesize of output 14132 [2023-04-01 04:51:46,894 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 14132 treesize of output 14096 [2023-04-01 04:51:47,053 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 14096 treesize of output 14088 [2023-04-01 04:51:47,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:47,252 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 14088 treesize of output 14065 [2023-04-01 04:51:47,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:47,536 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 14056 treesize of output 13833 [2023-04-01 04:51:47,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:47,752 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 13824 treesize of output 13585 [2023-04-01 04:51:47,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:47,968 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 13576 treesize of output 13241 [2023-04-01 04:51:48,147 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 13232 treesize of output 13220 [2023-04-01 04:51:48,314 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 13220 treesize of output 13144 [2023-04-01 04:51:48,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:48,525 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 13144 treesize of output 13037 [2023-04-01 04:51:48,710 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 13028 treesize of output 13012 [2023-04-01 04:51:48,878 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 13012 treesize of output 12948 [2023-04-01 04:51:49,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:49,157 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 12948 treesize of output 12957 [2023-04-01 04:51:49,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:49,482 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 12932 treesize of output 12921 [2023-04-01 04:51:49,703 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 12912 treesize of output 12876 [2023-04-01 04:51:49,895 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 12876 treesize of output 12856 [2023-04-01 04:51:50,097 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 12856 treesize of output 12780 [2023-04-01 04:51:50,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:50,331 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 12780 treesize of output 12717 [2023-04-01 04:51:50,521 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 12708 treesize of output 12670 [2023-04-01 04:51:50,752 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 12670 treesize of output 12544 [2023-04-01 04:51:50,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:50,986 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 12544 treesize of output 12385 [2023-04-01 04:51:51,185 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 12376 treesize of output 12332 [2023-04-01 04:51:51,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:51,445 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 12332 treesize of output 12293 [2023-04-01 04:51:51,640 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 12284 treesize of output 12248 [2023-04-01 04:51:51,830 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 12248 treesize of output 12234 [2023-04-01 04:51:52,037 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 12234 treesize of output 12202 [2023-04-01 04:51:52,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:52,274 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 12202 treesize of output 11987 [2023-04-01 04:51:52,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:52,527 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 11978 treesize of output 11943 [2023-04-01 04:51:52,774 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 11934 treesize of output 11924 [2023-04-01 04:51:52,977 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 11924 treesize of output 11912 [2023-04-01 04:51:53,182 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 11912 treesize of output 11660 [2023-04-01 04:51:53,391 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 11660 treesize of output 11606 [2023-04-01 04:51:53,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:53,640 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 11606 treesize of output 10531 [2023-04-01 04:51:53,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 04:51:53,892 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 10522 treesize of output 10451