/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 IntervalDomain -i ../sv-benchmarks/c/list-properties/list_flag-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 22:48:11,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 22:48:11,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 22:48:11,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 22:48:11,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 22:48:11,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 22:48:11,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 22:48:11,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 22:48:11,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 22:48:11,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 22:48:11,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 22:48:11,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 22:48:11,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 22:48:11,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 22:48:11,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 22:48:11,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 22:48:11,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 22:48:11,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 22:48:11,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 22:48:11,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 22:48:11,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 22:48:11,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 22:48:11,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 22:48:11,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 22:48:11,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 22:48:11,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 22:48:11,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 22:48:11,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 22:48:11,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 22:48:11,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 22:48:11,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 22:48:11,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 22:48:11,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 22:48:11,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 22:48:11,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 22:48:11,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 22:48:11,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 22:48:11,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 22:48:11,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 22:48:11,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 22:48:11,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 22:48:11,337 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-03-31 22:48:11,371 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 22:48:11,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 22:48:11,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 22:48:11,372 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 22:48:11,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 22:48:11,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 22:48:11,373 INFO L138 SettingsManager]: * User list type=DISABLED [2023-03-31 22:48:11,374 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-03-31 22:48:11,374 INFO L138 SettingsManager]: * Explicit value domain=true [2023-03-31 22:48:11,374 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-03-31 22:48:11,375 INFO L138 SettingsManager]: * Octagon Domain=false [2023-03-31 22:48:11,375 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-03-31 22:48:11,375 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-03-31 22:48:11,375 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-03-31 22:48:11,375 INFO L138 SettingsManager]: * Interval Domain=false [2023-03-31 22:48:11,375 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-03-31 22:48:11,375 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-03-31 22:48:11,375 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-03-31 22:48:11,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 22:48:11,376 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 22:48:11,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 22:48:11,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 22:48:11,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 22:48:11,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 22:48:11,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 22:48:11,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 22:48:11,377 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 22:48:11,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 22:48:11,377 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 22:48:11,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 22:48:11,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 22:48:11,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 22:48:11,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:48:11,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 22:48:11,378 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-03-31 22:48:11,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 22:48:11,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 22:48:11,379 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-03-31 22:48:11,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 22:48:11,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 22:48:11,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-03-31 22:48:11,379 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 -> IntervalDomain [2023-03-31 22:48:11,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 22:48:11,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 22:48:11,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 22:48:11,673 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 22:48:11,674 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 22:48:11,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2023-03-31 22:48:12,851 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 22:48:13,090 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 22:48:13,090 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2023-03-31 22:48:13,099 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6144841/8be0fe5fa1654be2b99a94a5492e205c/FLAGa118be817 [2023-03-31 22:48:13,109 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab6144841/8be0fe5fa1654be2b99a94a5492e205c [2023-03-31 22:48:13,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 22:48:13,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 22:48:13,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 22:48:13,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 22:48:13,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 22:48:13,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a81c440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13, skipping insertion in model container [2023-03-31 22:48:13,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 22:48:13,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 22:48:13,446 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/list-properties/list_flag-2.i[23375,23388] [2023-03-31 22:48:13,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:48:13,460 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 22:48:13,512 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/list-properties/list_flag-2.i[23375,23388] [2023-03-31 22:48:13,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 22:48:13,543 INFO L208 MainTranslator]: Completed translation [2023-03-31 22:48:13,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13 WrapperNode [2023-03-31 22:48:13,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 22:48:13,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 22:48:13,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 22:48:13,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 22:48:13,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,595 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 22:48:13,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 22:48:13,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 22:48:13,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 22:48:13,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (1/1) ... [2023-03-31 22:48:13,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 22:48:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:13,642 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-03-31 22:48:13,644 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-03-31 22:48:13,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 22:48:13,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 22:48:13,675 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 22:48:13,675 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-03-31 22:48:13,675 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-03-31 22:48:13,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2023-03-31 22:48:13,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2023-03-31 22:48:13,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2023-03-31 22:48:13,676 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-03-31 22:48:13,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 22:48:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 22:48:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 22:48:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-03-31 22:48:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-03-31 22:48:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-03-31 22:48:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-03-31 22:48:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-03-31 22:48:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-03-31 22:48:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-03-31 22:48:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-03-31 22:48:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-03-31 22:48:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-03-31 22:48:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-03-31 22:48:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-03-31 22:48:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-03-31 22:48:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-03-31 22:48:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 22:48:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 22:48:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 22:48:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 22:48:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 22:48:13,873 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 22:48:13,875 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 22:48:13,925 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-03-31 22:48:14,090 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 22:48:14,124 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 22:48:14,125 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-03-31 22:48:14,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:48:14 BoogieIcfgContainer [2023-03-31 22:48:14,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 22:48:14,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 22:48:14,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 22:48:14,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 22:48:14,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 10:48:13" (1/3) ... [2023-03-31 22:48:14,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c2a8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:48:14, skipping insertion in model container [2023-03-31 22:48:14,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 10:48:13" (2/3) ... [2023-03-31 22:48:14,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c2a8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 10:48:14, skipping insertion in model container [2023-03-31 22:48:14,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 10:48:14" (3/3) ... [2023-03-31 22:48:14,145 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2023-03-31 22:48:14,161 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 22:48:14,161 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 22:48:14,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 22:48:14,227 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;@65f587e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-31 22:48:14,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 22:48:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-31 22:48:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-03-31 22:48:14,239 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:14,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:14,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:14,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1903290210, now seen corresponding path program 1 times [2023-03-31 22:48:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:14,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277110818] [2023-03-31 22:48:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:14,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277110818] [2023-03-31 22:48:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277110818] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:48:14,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:48:14,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-31 22:48:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072343304] [2023-03-31 22:48:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:48:14,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-31 22:48:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:14,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-31 22:48:14,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-31 22:48:14,489 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03-31 22:48:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:14,526 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2023-03-31 22:48:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-31 22:48:14,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 14 [2023-03-31 22:48:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:14,533 INFO L225 Difference]: With dead ends: 43 [2023-03-31 22:48:14,533 INFO L226 Difference]: Without dead ends: 21 [2023-03-31 22:48:14,537 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-03-31 22:48:14,542 INFO L413 NwaCegarLoop]: 32 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, 32 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-03-31 22:48:14,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 22:48:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-03-31 22:48:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-03-31 22:48:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-03-31 22:48:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-03-31 22:48:14,575 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2023-03-31 22:48:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:14,576 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-03-31 22:48:14,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03-31 22:48:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-03-31 22:48:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-03-31 22:48:14,579 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:14,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:14,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 22:48:14,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:14,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -871490984, now seen corresponding path program 1 times [2023-03-31 22:48:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:14,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17597426] [2023-03-31 22:48:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:14,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:14,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17597426] [2023-03-31 22:48:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17597426] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:48:14,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:48:14,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 22:48:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571035491] [2023-03-31 22:48:14,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:48:14,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 22:48:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:14,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 22:48:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 22:48:14,917 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-03-31 22:48:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:15,043 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2023-03-31 22:48:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 22:48:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2023-03-31 22:48:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:15,046 INFO L225 Difference]: With dead ends: 43 [2023-03-31 22:48:15,046 INFO L226 Difference]: Without dead ends: 39 [2023-03-31 22:48:15,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-03-31 22:48:15,053 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:15,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:48:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-03-31 22:48:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2023-03-31 22:48:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-03-31 22:48:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-03-31 22:48:15,067 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2023-03-31 22:48:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:15,067 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-03-31 22:48:15,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-03-31 22:48:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-03-31 22:48:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-03-31 22:48:15,068 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:15,068 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:15,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 22:48:15,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:15,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash 64463731, now seen corresponding path program 1 times [2023-03-31 22:48:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:15,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182994421] [2023-03-31 22:48:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:15,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:15,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182994421] [2023-03-31 22:48:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182994421] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:48:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:48:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 22:48:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496830668] [2023-03-31 22:48:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:48:15,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 22:48:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 22:48:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 22:48:15,210 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-31 22:48:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:15,285 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-03-31 22:48:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 22:48:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2023-03-31 22:48:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:15,286 INFO L225 Difference]: With dead ends: 45 [2023-03-31 22:48:15,286 INFO L226 Difference]: Without dead ends: 37 [2023-03-31 22:48:15,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-03-31 22:48:15,287 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:15,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 63 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:48:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-03-31 22:48:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-03-31 22:48:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-03-31 22:48:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-03-31 22:48:15,292 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2023-03-31 22:48:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:15,292 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-03-31 22:48:15,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-31 22:48:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-03-31 22:48:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-03-31 22:48:15,293 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:15,293 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:15,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 22:48:15,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:15,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1179277790, now seen corresponding path program 1 times [2023-03-31 22:48:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824042942] [2023-03-31 22:48:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:15,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824042942] [2023-03-31 22:48:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824042942] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 22:48:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 22:48:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 22:48:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773538837] [2023-03-31 22:48:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 22:48:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 22:48:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 22:48:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 22:48:15,410 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-31 22:48:15,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:15,459 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-03-31 22:48:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 22:48:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2023-03-31 22:48:15,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:15,461 INFO L225 Difference]: With dead ends: 43 [2023-03-31 22:48:15,461 INFO L226 Difference]: Without dead ends: 33 [2023-03-31 22:48:15,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-03-31 22:48:15,462 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:15,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 22:48:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-03-31 22:48:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2023-03-31 22:48:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-03-31 22:48:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-03-31 22:48:15,466 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2023-03-31 22:48:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:15,467 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-03-31 22:48:15,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03-31 22:48:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-03-31 22:48:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-03-31 22:48:15,467 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:15,467 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:15,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 22:48:15,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:15,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1532175620, now seen corresponding path program 1 times [2023-03-31 22:48:15,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:15,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036885196] [2023-03-31 22:48:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:15,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:15,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036885196] [2023-03-31 22:48:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036885196] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881992721] [2023-03-31 22:48:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:15,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:15,733 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-03-31 22:48:15,769 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-03-31 22:48:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:15,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2023-03-31 22:48:15,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:15,938 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-03-31 22:48:16,076 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 22:48:16,077 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 11 treesize of output 11 [2023-03-31 22:48:16,091 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-03-31 22:48:16,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-03-31 22:48:16,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-03-31 22:48:16,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-03-31 22:48:16,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-03-31 22:48:16,268 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 19 treesize of output 21 [2023-03-31 22:48:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:16,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:16,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:16,441 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 2 case distinctions, treesize of input 23 treesize of output 29 [2023-03-31 22:48:16,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:16,460 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 30 treesize of output 33 [2023-03-31 22:48:16,467 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 9 treesize of output 7 [2023-03-31 22:48:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881992721] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:48:16,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2127860351] [2023-03-31 22:48:16,589 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 22:48:16,590 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:16,593 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:16,597 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:16,597 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:16,650 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:48:17,027 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:48:17,033 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:17,267 WARN L861 $PredicateComparison]: unable to prove that (and (= c_main_~t~0.offset 0) (exists ((|v_main_#t~nondet5_16| Int)) (and (let ((.cse0 (<= 0 (+ |v_main_#t~nondet5_16| 2147483648))) (.cse1 (<= |v_main_#t~nondet5_16| 2147483647))) (or (and (= c_main_~p~0.offset 0) (<= 0 (+ 2147483648 c_main_~flag~0)) (= |c_#NULL.offset| 0) (= c_main_~a~0.offset 0) (= |c_#NULL.base| 0) (<= c_main_~flag~0 2147483647) .cse0 .cse1 (<= 0 |c_#StackHeapBarrier|)) (and .cse0 .cse1))) (not (= |v_main_#t~nondet5_16| 0)))) (exists ((|v_#length_24| (Array Int Int))) (= (store |v_#length_24| c_main_~t~0.base 8) |c_#length|)) (not (= c_main_~t~0.base 0)) (< c_main_~t~0.base |c_#StackHeapBarrier|) (let ((.cse2 (= 0 c_main_~flag~0)) (.cse3 (exists ((|v_#memory_$Pointer$.offset_32| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_32| c_main_~p~0.base (store (select |v_#memory_$Pointer$.offset_32| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) c_main_~p~0.offset))) |c_#memory_$Pointer$.offset|))) (.cse4 (exists ((|v_#memory_$Pointer$.base_33| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_33| c_main_~p~0.base (store (select |v_#memory_$Pointer$.base_33| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.base| c_main_~p~0.base) c_main_~p~0.offset))))))) (or (and (exists ((|v_#memory_int_38| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_38| c_main_~p~0.base (store (select |v_#memory_int_38| c_main_~p~0.base) c_main_~p~0.offset 2)))) .cse2 .cse3 .cse4) (and (not .cse2) (exists ((|v_#memory_int_38| (Array Int (Array Int Int)))) (= (store |v_#memory_int_38| c_main_~p~0.base (store (select |v_#memory_int_38| c_main_~p~0.base) c_main_~p~0.offset 1)) |c_#memory_int|)) .cse3 .cse4))) (exists ((|v_#valid_25| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_25| c_main_~t~0.base 1)) (= (select |v_#valid_25| c_main_~t~0.base) 0)))) is different from true [2023-03-31 22:48:17,545 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '555#(and (= main_~a~0.offset main_~p~0.offset) (= main_~a~0.base main_~p~0.base) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~flag~0 0) (exists ((|v_#memory_$Pointer$.offset_31| (Array Int (Array Int Int))) (v_main_~p~0.offset_27 Int) (|v_#memory_$Pointer$.base_32| (Array Int (Array Int Int))) (|v_#memory_int_37| (Array Int (Array Int Int))) (v_main_~p~0.base_29 Int)) (and (= (store |v_#memory_$Pointer$.base_32| v_main_~p~0.base_29 (store (select |v_#memory_$Pointer$.base_32| v_main_~p~0.base_29) v_main_~p~0.offset_27 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) v_main_~p~0.offset_27))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_31| v_main_~p~0.base_29 (store (select |v_#memory_$Pointer$.offset_31| v_main_~p~0.base_29) v_main_~p~0.offset_27 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) v_main_~p~0.offset_27)))) (= |#memory_int| (store |v_#memory_int_37| v_main_~p~0.base_29 (store (select |v_#memory_int_37| v_main_~p~0.base_29) v_main_~p~0.offset_27 3))))) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)))' at error location [2023-03-31 22:48:17,545 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:17,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:48:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-03-31 22:48:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358655284] [2023-03-31 22:48:17,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:17,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-31 22:48:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:17,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-31 22:48:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=886, Unknown=3, NotChecked=60, Total=1056 [2023-03-31 22:48:17,548 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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-03-31 22:48:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:18,068 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2023-03-31 22:48:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-31 22:48:18,068 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 20 [2023-03-31 22:48:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:18,069 INFO L225 Difference]: With dead ends: 58 [2023-03-31 22:48:18,069 INFO L226 Difference]: Without dead ends: 54 [2023-03-31 22:48:18,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=1484, Unknown=7, NotChecked=80, Total=1806 [2023-03-31 22:48:18,070 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 136 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:18,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 102 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 0.2s Time] [2023-03-31 22:48:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-03-31 22:48:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2023-03-31 22:48:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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-03-31 22:48:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-03-31 22:48:18,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2023-03-31 22:48:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:18,080 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-03-31 22:48:18,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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-03-31 22:48:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-03-31 22:48:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-03-31 22:48:18,082 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:18,082 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:18,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-03-31 22:48:18,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:18,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:18,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1975912565, now seen corresponding path program 1 times [2023-03-31 22:48:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246080004] [2023-03-31 22:48:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:18,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246080004] [2023-03-31 22:48:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246080004] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756565768] [2023-03-31 22:48:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:18,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:18,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:18,596 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-03-31 22:48:18,600 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-03-31 22:48:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:18,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2023-03-31 22:48:18,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:18,714 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-03-31 22:48:18,774 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 22:48:18,774 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 11 treesize of output 11 [2023-03-31 22:48:18,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-03-31 22:48:18,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-03-31 22:48:18,786 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-03-31 22:48:18,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-03-31 22:48:18,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-03-31 22:48:18,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-03-31 22:48:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:18,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:18,978 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 169 treesize of output 161 [2023-03-31 22:48:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756565768] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:48:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1629960189] [2023-03-31 22:48:19,059 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 22:48:19,059 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:19,060 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:19,060 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:19,060 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:19,078 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:48:19,329 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:48:19,332 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:19,542 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= 0 c_main_~flag~0)) (.cse1 (exists ((|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_46| c_main_~p~0.base (store (select |v_#memory_$Pointer$.base_46| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.base| c_main_~p~0.base) c_main_~p~0.offset)))))) (.cse2 (exists ((|v_#memory_$Pointer$.offset_44| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_44| c_main_~p~0.base (store (select |v_#memory_$Pointer$.offset_44| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) c_main_~p~0.offset))))))) (or (and .cse0 .cse1 .cse2 (exists ((|v_#memory_int_52| (Array Int (Array Int Int)))) (= (store |v_#memory_int_52| c_main_~p~0.base (store (select |v_#memory_int_52| c_main_~p~0.base) c_main_~p~0.offset 2)) |c_#memory_int|))) (and (not .cse0) .cse1 (exists ((|v_#memory_int_52| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_52| c_main_~p~0.base (store (select |v_#memory_int_52| c_main_~p~0.base) c_main_~p~0.offset 1)))) .cse2))) (exists ((|v_main_#t~nondet5_23| Int)) (and (let ((.cse3 (<= 0 (+ |v_main_#t~nondet5_23| 2147483648))) (.cse4 (<= |v_main_#t~nondet5_23| 2147483647))) (or (and .cse3 .cse4) (and (= c_main_~p~0.offset 0) .cse3 (<= 0 (+ 2147483648 c_main_~flag~0)) (= |c_#NULL.offset| 0) .cse4 (= c_main_~a~0.offset 0) (= |c_#NULL.base| 0) (<= c_main_~flag~0 2147483647) (<= 0 |c_#StackHeapBarrier|)))) (not (= |v_main_#t~nondet5_23| 0)))) (= c_main_~t~0.offset 0) (exists ((|v_#valid_33| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_33| c_main_~t~0.base 1)) (= (select |v_#valid_33| c_main_~t~0.base) 0))) (not (= c_main_~t~0.base 0)) (< c_main_~t~0.base |c_#StackHeapBarrier|) (exists ((|v_#length_31| (Array Int Int))) (= (store |v_#length_31| c_main_~t~0.base 8) |c_#length|))) is different from true [2023-03-31 22:48:19,817 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '842#(and (= main_~a~0.offset main_~p~0.offset) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1)) (not (= main_~flag~0 0)) (= main_~a~0.base main_~p~0.base) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (exists ((v_main_~p~0.base_39 Int) (|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_43| (Array Int (Array Int Int))) (v_main_~p~0.offset_35 Int) (|v_#memory_$Pointer$.base_45| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_45| v_main_~p~0.base_39 (store (select |v_#memory_$Pointer$.base_45| v_main_~p~0.base_39) v_main_~p~0.offset_35 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) v_main_~p~0.offset_35)))) (= |#memory_int| (store |v_#memory_int_51| v_main_~p~0.base_39 (store (select |v_#memory_int_51| v_main_~p~0.base_39) v_main_~p~0.offset_35 3))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_43| v_main_~p~0.base_39 (store (select |v_#memory_$Pointer$.offset_43| v_main_~p~0.base_39) v_main_~p~0.offset_35 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) v_main_~p~0.offset_35)))))))' at error location [2023-03-31 22:48:19,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:19,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:48:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-03-31 22:48:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400337019] [2023-03-31 22:48:19,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:19,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-31 22:48:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-31 22:48:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=4, NotChecked=58, Total=992 [2023-03-31 22:48:19,819 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-03-31 22:48:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:20,333 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-03-31 22:48:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-31 22:48:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 20 [2023-03-31 22:48:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:20,335 INFO L225 Difference]: With dead ends: 52 [2023-03-31 22:48:20,336 INFO L226 Difference]: Without dead ends: 48 [2023-03-31 22:48:20,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1405, Unknown=9, NotChecked=78, Total=1722 [2023-03-31 22:48:20,337 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 102 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:20,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 129 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:48:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-03-31 22:48:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2023-03-31 22:48:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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-03-31 22:48:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-03-31 22:48:20,343 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2023-03-31 22:48:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:20,343 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-03-31 22:48:20,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-03-31 22:48:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2023-03-31 22:48:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-03-31 22:48:20,344 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:20,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:20,360 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-03-31 22:48:20,553 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,SelfDestructingSolverStorable5 [2023-03-31 22:48:20,553 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:20,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash 801688343, now seen corresponding path program 1 times [2023-03-31 22:48:20,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:20,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179001091] [2023-03-31 22:48:20,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:20,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:20,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179001091] [2023-03-31 22:48:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179001091] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807719728] [2023-03-31 22:48:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:20,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:20,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:20,919 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-03-31 22:48:20,922 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-03-31 22:48:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:21,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 40 conjunts are in the unsatisfiable core [2023-03-31 22:48:21,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:21,044 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-03-31 22:48:21,073 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 22:48:21,074 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 11 treesize of output 11 [2023-03-31 22:48:21,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:21,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:21,149 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:21,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-03-31 22:48:21,155 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 34 treesize of output 36 [2023-03-31 22:48:21,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-03-31 22:48:21,190 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 31 treesize of output 19 [2023-03-31 22:48:21,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-31 22:48:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:21,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:21,232 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 79 treesize of output 57 [2023-03-31 22:48:21,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:21,281 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 22 treesize of output 23 [2023-03-31 22:48:21,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:21,290 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 38 treesize of output 31 [2023-03-31 22:48:21,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:21,309 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:21,309 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-03-31 22:48:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807719728] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:48:21,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1957035725] [2023-03-31 22:48:21,411 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 22:48:21,411 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:21,411 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:21,411 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:21,411 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:21,436 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:48:21,733 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:48:21,738 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:21,936 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse1 (= 0 c_main_~flag~0)) (.cse0 (exists ((|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_59| c_main_~p~0.base (store (select |v_#memory_$Pointer$.base_59| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.base| c_main_~p~0.base) c_main_~p~0.offset))) |c_#memory_$Pointer$.base|))) (.cse2 (exists ((|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_57| c_main_~p~0.base (store (select |v_#memory_$Pointer$.offset_57| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) c_main_~p~0.offset))) |c_#memory_$Pointer$.offset|)))) (or (and (exists ((|v_#memory_int_64| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_64| c_main_~p~0.base (store (select |v_#memory_int_64| c_main_~p~0.base) c_main_~p~0.offset 2)))) .cse0 .cse1 .cse2) (and (not .cse1) .cse0 (exists ((|v_#memory_int_64| (Array Int (Array Int Int)))) (= (store |v_#memory_int_64| c_main_~p~0.base (store (select |v_#memory_int_64| c_main_~p~0.base) c_main_~p~0.offset 1)) |c_#memory_int|)) .cse2))) (= c_main_~t~0.offset 0) (exists ((|v_main_#t~nondet5_30| Int)) (and (let ((.cse3 (<= 0 (+ |v_main_#t~nondet5_30| 2147483648))) (.cse4 (<= |v_main_#t~nondet5_30| 2147483647))) (or (and .cse3 .cse4) (and .cse3 (= c_main_~p~0.offset 0) (<= 0 (+ 2147483648 c_main_~flag~0)) (= |c_#NULL.offset| 0) .cse4 (= c_main_~a~0.offset 0) (= |c_#NULL.base| 0) (<= c_main_~flag~0 2147483647) (<= 0 |c_#StackHeapBarrier|)))) (not (= |v_main_#t~nondet5_30| 0)))) (exists ((|v_#length_38| (Array Int Int))) (= (store |v_#length_38| c_main_~t~0.base 8) |c_#length|)) (not (= c_main_~t~0.base 0)) (< c_main_~t~0.base |c_#StackHeapBarrier|) (exists ((|v_#valid_41| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_41| c_main_~t~0.base 1)) (= (select |v_#valid_41| c_main_~t~0.base) 0)))) is different from true [2023-03-31 22:48:22,057 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1134#(and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~flag~0 0))' at error location [2023-03-31 22:48:22,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:22,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:48:22,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2023-03-31 22:48:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956794346] [2023-03-31 22:48:22,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:22,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-03-31 22:48:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-03-31 22:48:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=580, Unknown=5, NotChecked=48, Total=702 [2023-03-31 22:48:22,059 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-03-31 22:48:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:22,271 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-03-31 22:48:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 22:48:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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 22 [2023-03-31 22:48:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:22,273 INFO L225 Difference]: With dead ends: 57 [2023-03-31 22:48:22,273 INFO L226 Difference]: Without dead ends: 53 [2023-03-31 22:48:22,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=817, Unknown=7, NotChecked=58, Total=992 [2023-03-31 22:48:22,274 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 81 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:22,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 140 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:48:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-03-31 22:48:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2023-03-31 22:48:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 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-03-31 22:48:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-03-31 22:48:22,284 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 22 [2023-03-31 22:48:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:22,284 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-03-31 22:48:22,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 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-03-31 22:48:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-03-31 22:48:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-03-31 22:48:22,285 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:22,285 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:22,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-31 22:48:22,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:22,492 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:22,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:22,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1672028274, now seen corresponding path program 2 times [2023-03-31 22:48:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:22,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572007209] [2023-03-31 22:48:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:22,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572007209] [2023-03-31 22:48:22,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572007209] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064652951] [2023-03-31 22:48:22,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 22:48:22,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:22,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:22,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:48:22,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-31 22:48:22,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-31 22:48:22,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:48:22,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 39 conjunts are in the unsatisfiable core [2023-03-31 22:48:22,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:22,900 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-03-31 22:48:22,927 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 22:48:22,927 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 11 treesize of output 11 [2023-03-31 22:48:22,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:22,953 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-03-31 22:48:22,989 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:22,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-03-31 22:48:22,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-03-31 22:48:22,996 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 26 treesize of output 28 [2023-03-31 22:48:23,026 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 31 treesize of output 19 [2023-03-31 22:48:23,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-31 22:48:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:23,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:23,071 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 52 treesize of output 30 [2023-03-31 22:48:23,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:23,128 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 22 treesize of output 23 [2023-03-31 22:48:23,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:23,134 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 38 treesize of output 31 [2023-03-31 22:48:23,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:23,154 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:23,154 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 1 case distinctions, treesize of input 22 treesize of output 1 [2023-03-31 22:48:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064652951] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:48:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [515368924] [2023-03-31 22:48:23,272 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 22:48:23,272 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:23,273 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:23,273 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:23,273 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:23,287 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:48:23,488 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:48:23,495 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:23,663 WARN L861 $PredicateComparison]: unable to prove that (and (= c_main_~t~0.offset 0) (not (= c_main_~t~0.base 0)) (exists ((|v_#length_45| (Array Int Int))) (= (store |v_#length_45| c_main_~t~0.base 8) |c_#length|)) (let ((.cse0 (= 0 c_main_~flag~0)) (.cse1 (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| c_main_~p~0.base (store (select |v_#memory_$Pointer$.base_72| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.base| c_main_~p~0.base) c_main_~p~0.offset))) |c_#memory_$Pointer$.base|))) (.cse2 (exists ((|v_#memory_$Pointer$.offset_70| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_70| c_main_~p~0.base (store (select |v_#memory_$Pointer$.offset_70| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) c_main_~p~0.offset))) |c_#memory_$Pointer$.offset|)))) (or (and (exists ((|v_#memory_int_76| (Array Int (Array Int Int)))) (= (store |v_#memory_int_76| c_main_~p~0.base (store (select |v_#memory_int_76| c_main_~p~0.base) c_main_~p~0.offset 1)) |c_#memory_int|)) (not .cse0) .cse1 .cse2) (and (exists ((|v_#memory_int_76| (Array Int (Array Int Int)))) (= (store |v_#memory_int_76| c_main_~p~0.base (store (select |v_#memory_int_76| c_main_~p~0.base) c_main_~p~0.offset 2)) |c_#memory_int|)) .cse0 .cse1 .cse2))) (< c_main_~t~0.base |c_#StackHeapBarrier|) (exists ((|v_#valid_49| (Array Int Int))) (and (= (select |v_#valid_49| c_main_~t~0.base) 0) (= |c_#valid| (store |v_#valid_49| c_main_~t~0.base 1)))) (exists ((|v_main_#t~nondet5_37| Int)) (and (not (= |v_main_#t~nondet5_37| 0)) (let ((.cse3 (<= 0 (+ |v_main_#t~nondet5_37| 2147483648))) (.cse4 (<= |v_main_#t~nondet5_37| 2147483647))) (or (and .cse3 .cse4) (and (= c_main_~p~0.offset 0) .cse3 (<= 0 (+ 2147483648 c_main_~flag~0)) (= |c_#NULL.offset| 0) .cse4 (= c_main_~a~0.offset 0) (= |c_#NULL.base| 0) (<= c_main_~flag~0 2147483647) (<= 0 |c_#StackHeapBarrier|))))))) is different from true [2023-03-31 22:48:23,781 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1445#(and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~flag~0 0))' at error location [2023-03-31 22:48:23,781 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:23,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:48:23,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-03-31 22:48:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50525741] [2023-03-31 22:48:23,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:23,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-03-31 22:48:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-03-31 22:48:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=680, Unknown=5, NotChecked=52, Total=812 [2023-03-31 22:48:23,783 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 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-03-31 22:48:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:23,987 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2023-03-31 22:48:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 22:48:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 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 24 [2023-03-31 22:48:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:23,988 INFO L225 Difference]: With dead ends: 59 [2023-03-31 22:48:23,988 INFO L226 Difference]: Without dead ends: 49 [2023-03-31 22:48:23,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=934, Unknown=7, NotChecked=62, Total=1122 [2023-03-31 22:48:23,989 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:23,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 153 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 22:48:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-03-31 22:48:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2023-03-31 22:48:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 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-03-31 22:48:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-03-31 22:48:23,997 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 24 [2023-03-31 22:48:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:23,997 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-03-31 22:48:23,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 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-03-31 22:48:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-03-31 22:48:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-03-31 22:48:23,998 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:23,998 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:24,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-31 22:48:24,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:24,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:24,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 423035201, now seen corresponding path program 1 times [2023-03-31 22:48:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366540432] [2023-03-31 22:48:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:24,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:24,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:24,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366540432] [2023-03-31 22:48:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366540432] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157137407] [2023-03-31 22:48:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:24,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:24,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:24,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:48:24,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-31 22:48:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:24,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjunts are in the unsatisfiable core [2023-03-31 22:48:24,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:24,597 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-03-31 22:48:24,629 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 22:48:24,630 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 11 treesize of output 11 [2023-03-31 22:48:24,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-03-31 22:48:24,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-03-31 22:48:24,696 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:24,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2023-03-31 22:48:24,702 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 42 treesize of output 44 [2023-03-31 22:48:24,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-03-31 22:48:24,732 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 39 treesize of output 21 [2023-03-31 22:48:24,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-03-31 22:48:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:24,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:24,780 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 52 treesize of output 30 [2023-03-31 22:48:24,786 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~a~0.offset 4))) (and (forall ((v_ArrVal_320 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_320) c_main_~a~0.base) .cse0) c_main_~p~0.offset)) (forall ((v_ArrVal_319 (Array Int Int))) (= c_main_~p~0.base (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_319) c_main_~a~0.base) .cse0))))) is different from false [2023-03-31 22:48:24,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:24,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-03-31 22:48:24,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:24,809 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 36 treesize of output 35 [2023-03-31 22:48:24,822 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 7 treesize of output 3 [2023-03-31 22:48:24,827 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:24,827 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 22 treesize of output 1 [2023-03-31 22:48:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-03-31 22:48:24,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157137407] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:48:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446814940] [2023-03-31 22:48:24,889 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 22:48:24,889 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:24,890 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:24,890 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:24,890 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:24,906 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:48:25,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:48:25,119 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:25,274 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse2 (= 0 c_main_~flag~0)) (.cse0 (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| c_main_~p~0.base (store (select |v_#memory_$Pointer$.base_85| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.base| c_main_~p~0.base) c_main_~p~0.offset)))))) (.cse1 (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_83| c_main_~p~0.base (store (select |v_#memory_$Pointer$.offset_83| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) c_main_~p~0.offset))) |c_#memory_$Pointer$.offset|)))) (or (and .cse0 .cse1 .cse2 (exists ((|v_#memory_int_88| (Array Int (Array Int Int)))) (= (store |v_#memory_int_88| c_main_~p~0.base (store (select |v_#memory_int_88| c_main_~p~0.base) c_main_~p~0.offset 2)) |c_#memory_int|))) (and (not .cse2) .cse0 .cse1 (exists ((|v_#memory_int_88| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_88| c_main_~p~0.base (store (select |v_#memory_int_88| c_main_~p~0.base) c_main_~p~0.offset 1))))))) (= c_main_~t~0.offset 0) (not (= c_main_~t~0.base 0)) (< c_main_~t~0.base |c_#StackHeapBarrier|) (exists ((|v_#length_52| (Array Int Int))) (= (store |v_#length_52| c_main_~t~0.base 8) |c_#length|)) (exists ((|v_#valid_57| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_57| c_main_~t~0.base 1)) (= (select |v_#valid_57| c_main_~t~0.base) 0))) (exists ((|v_main_#t~nondet5_44| Int)) (and (not (= |v_main_#t~nondet5_44| 0)) (let ((.cse3 (<= |v_main_#t~nondet5_44| 2147483647)) (.cse4 (<= 0 (+ |v_main_#t~nondet5_44| 2147483648)))) (or (and .cse3 .cse4) (and .cse3 (= c_main_~p~0.offset 0) (<= 0 (+ 2147483648 c_main_~flag~0)) (= |c_#NULL.offset| 0) .cse4 (= c_main_~a~0.offset 0) (= |c_#NULL.base| 0) (<= c_main_~flag~0 2147483647) (<= 0 |c_#StackHeapBarrier|))))))) is different from true [2023-03-31 22:48:25,397 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1759#(and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1)) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)))' at error location [2023-03-31 22:48:25,397 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:25,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:48:25,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-03-31 22:48:25,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924779391] [2023-03-31 22:48:25,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:25,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-03-31 22:48:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-03-31 22:48:25,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=785, Unknown=5, NotChecked=114, Total=992 [2023-03-31 22:48:25,399 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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-03-31 22:48:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:25,664 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-03-31 22:48:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 22:48:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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 24 [2023-03-31 22:48:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:25,664 INFO L225 Difference]: With dead ends: 55 [2023-03-31 22:48:25,665 INFO L226 Difference]: Without dead ends: 43 [2023-03-31 22:48:25,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=1051, Unknown=7, NotChecked=134, Total=1332 [2023-03-31 22:48:25,666 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:25,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 194 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 24 Unknown, 38 Unchecked, 0.1s Time] [2023-03-31 22:48:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-03-31 22:48:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2023-03-31 22:48:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 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-03-31 22:48:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-03-31 22:48:25,671 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 24 [2023-03-31 22:48:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:25,671 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-03-31 22:48:25,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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-03-31 22:48:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-03-31 22:48:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-03-31 22:48:25,672 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:25,672 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:25,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-31 22:48:25,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:25,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:25,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 701857979, now seen corresponding path program 3 times [2023-03-31 22:48:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:25,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274930760] [2023-03-31 22:48:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:26,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274930760] [2023-03-31 22:48:26,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274930760] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:26,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025865987] [2023-03-31 22:48:26,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 22:48:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:26,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:48:26,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-31 22:48:26,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 22:48:26,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:48:26,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 55 conjunts are in the unsatisfiable core [2023-03-31 22:48:26,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:26,701 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-03-31 22:48:26,732 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-31 22:48:26,732 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-03-31 22:48:26,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:26,780 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-03-31 22:48:26,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:26,835 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 59 treesize of output 61 [2023-03-31 22:48:26,847 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:26,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2023-03-31 22:48:26,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2023-03-31 22:48:26,872 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-03-31 22:48:26,872 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-03-31 22:48:26,881 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 8 treesize of output 7 [2023-03-31 22:48:26,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-03-31 22:48:26,979 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-03-31 22:48:27,100 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-03-31 22:48:27,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 67 [2023-03-31 22:48:27,107 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 100 treesize of output 99 [2023-03-31 22:48:27,119 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:27,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 93 [2023-03-31 22:48:27,256 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-03-31 22:48:27,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 127 [2023-03-31 22:48:27,267 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-03-31 22:48:27,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 161 [2023-03-31 22:48:27,277 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:27,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2023-03-31 22:48:27,392 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-03-31 22:48:27,392 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2023-03-31 22:48:27,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-31 22:48:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:27,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:27,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,614 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 52 treesize of output 56 [2023-03-31 22:48:27,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,622 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 59 treesize of output 65 [2023-03-31 22:48:27,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,631 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 118 treesize of output 121 [2023-03-31 22:48:27,638 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 45 treesize of output 27 [2023-03-31 22:48:27,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-03-31 22:48:27,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,796 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 25 treesize of output 26 [2023-03-31 22:48:27,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,808 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 178 treesize of output 129 [2023-03-31 22:48:27,816 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 25 treesize of output 21 [2023-03-31 22:48:27,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-03-31 22:48:27,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,872 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-03-31 22:48:27,875 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:27,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,883 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 47 treesize of output 46 [2023-03-31 22:48:27,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,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 41 treesize of output 33 [2023-03-31 22:48:27,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,950 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 29 treesize of output 30 [2023-03-31 22:48:27,953 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:27,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,960 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 36 treesize of output 35 [2023-03-31 22:48:27,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:27,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 22 treesize of output 22 [2023-03-31 22:48:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025865987] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:48:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [908351867] [2023-03-31 22:48:28,239 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 22:48:28,239 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:28,239 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:28,240 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:28,240 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:28,260 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:48:28,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:48:28,437 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:28,667 WARN L861 $PredicateComparison]: unable to prove that (and (= c_main_~t~0.offset 0) (exists ((|v_#length_60| (Array Int Int))) (= (store |v_#length_60| c_main_~t~0.base 8) |c_#length|)) (let ((.cse0 (= 0 c_main_~flag~0)) (.cse1 (exists ((|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_100| c_main_~p~0.base (store (select |v_#memory_$Pointer$.offset_100| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) c_main_~p~0.offset)))))) (.cse2 (exists ((|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_102| c_main_~p~0.base (store (select |v_#memory_$Pointer$.base_102| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.base| c_main_~p~0.base) c_main_~p~0.offset))))))) (or (and (not .cse0) .cse1 (exists ((|v_#memory_int_104| (Array Int (Array Int Int)))) (= (store |v_#memory_int_104| c_main_~p~0.base (store (select |v_#memory_int_104| c_main_~p~0.base) c_main_~p~0.offset 1)) |c_#memory_int|)) .cse2) (and .cse0 (exists ((|v_#memory_int_104| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_104| c_main_~p~0.base (store (select |v_#memory_int_104| c_main_~p~0.base) c_main_~p~0.offset 2)))) .cse1 .cse2))) (not (= c_main_~t~0.base 0)) (< c_main_~t~0.base |c_#StackHeapBarrier|) (exists ((|v_#valid_67| (Array Int Int))) (and (= (select |v_#valid_67| c_main_~t~0.base) 0) (= |c_#valid| (store |v_#valid_67| c_main_~t~0.base 1)))) (exists ((|v_main_#t~nondet5_52| Int)) (and (let ((.cse3 (<= 0 (+ |v_main_#t~nondet5_52| 2147483648))) (.cse4 (<= |v_main_#t~nondet5_52| 2147483647))) (or (and (= c_main_~p~0.offset 0) (<= 0 (+ 2147483648 c_main_~flag~0)) (= |c_#NULL.offset| 0) .cse3 (= c_main_~a~0.offset 0) (= |c_#NULL.base| 0) (<= c_main_~flag~0 2147483647) (<= 0 |c_#StackHeapBarrier|) .cse4) (and .cse3 .cse4))) (not (= |v_main_#t~nondet5_52| 0))))) is different from true [2023-03-31 22:48:28,822 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2081#(and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~flag~0 0))' at error location [2023-03-31 22:48:28,822 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:28,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:48:28,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2023-03-31 22:48:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146637211] [2023-03-31 22:48:28,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-03-31 22:48:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-03-31 22:48:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1286, Unknown=8, NotChecked=72, Total=1482 [2023-03-31 22:48:28,825 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-03-31 22:48:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:31,618 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-03-31 22:48:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-31 22:48:31,618 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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 26 [2023-03-31 22:48:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:31,619 INFO L225 Difference]: With dead ends: 57 [2023-03-31 22:48:31,619 INFO L226 Difference]: Without dead ends: 53 [2023-03-31 22:48:31,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=218, Invalid=2032, Unknown=10, NotChecked=92, Total=2352 [2023-03-31 22:48:31,620 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 98 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:31,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 249 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 362 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-03-31 22:48:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-03-31 22:48:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2023-03-31 22:48:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 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-03-31 22:48:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-03-31 22:48:31,626 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 26 [2023-03-31 22:48:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:31,626 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-03-31 22:48:31,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 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-03-31 22:48:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-03-31 22:48:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-03-31 22:48:31,627 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:31,627 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:31,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-31 22:48:31,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:31,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:31,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash -541883542, now seen corresponding path program 2 times [2023-03-31 22:48:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070265903] [2023-03-31 22:48:31,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:32,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070265903] [2023-03-31 22:48:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070265903] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441698133] [2023-03-31 22:48:32,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 22:48:32,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:32,521 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:48:32,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-03-31 22:48:32,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-31 22:48:32,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 22:48:32,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 65 conjunts are in the unsatisfiable core [2023-03-31 22:48:32,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:32,678 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-03-31 22:48:32,709 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 22:48:32,709 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 11 treesize of output 11 [2023-03-31 22:48:32,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:32,763 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-03-31 22:48:32,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 62 [2023-03-31 22:48:32,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:32,824 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 48 treesize of output 50 [2023-03-31 22:48:32,837 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:32,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2023-03-31 22:48:32,845 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 8 treesize of output 7 [2023-03-31 22:48:32,907 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 8 treesize of output 1 [2023-03-31 22:48:33,065 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:33,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2023-03-31 22:48:33,080 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-31 22:48:33,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2023-03-31 22:48:33,086 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 69 treesize of output 68 [2023-03-31 22:48:33,217 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-03-31 22:48:33,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2023-03-31 22:48:33,233 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-03-31 22:48:33,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 76 [2023-03-31 22:48:33,261 INFO L321 Elim1Store]: treesize reduction 34, result has 40.4 percent of original size [2023-03-31 22:48:33,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 69 [2023-03-31 22:48:33,535 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 16 treesize of output 12 [2023-03-31 22:48:33,551 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 16 treesize of output 12 [2023-03-31 22:48:33,562 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 38 treesize of output 32 [2023-03-31 22:48:33,568 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 25 treesize of output 19 [2023-03-31 22:48:33,584 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 21 treesize of output 15 [2023-03-31 22:48:33,590 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 19 treesize of output 15 [2023-03-31 22:48:34,049 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 81 treesize of output 57 [2023-03-31 22:48:34,057 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-31 22:48:34,058 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 61 treesize of output 45 [2023-03-31 22:48:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:34,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:34,774 INFO L321 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2023-03-31 22:48:34,775 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 2291 treesize of output 2179 [2023-03-31 22:48:34,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:34,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 450 treesize of output 474 [2023-03-31 22:48:34,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:34,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:34,973 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-03-31 22:48:34,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-03-31 22:48:34,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:34,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:34,999 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-03-31 22:48:35,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-03-31 22:48:35,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:35,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-03-31 22:48:35,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-03-31 22:48:35,071 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:35,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2023-03-31 22:48:35,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2023-03-31 22:48:35,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:35,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2023-03-31 22:48:35,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:35,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 11 [2023-03-31 22:48:35,698 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 8 treesize of output 4 [2023-03-31 22:48:36,358 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_main_~p~0.offset 0)) (.cse1 (+ c_main_~p~0.offset 4)) (.cse0 (+ c_main_~a~0.offset 4))) (and (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) c_main_~a~0.base)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 4) 0)) (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse2 c_main_~p~0.offset) (= .cse2 0)))) (= v_main_~p~0.base_109 c_main_~a~0.base))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0) 0))) (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse3 c_main_~a~0.base) (= c_main_~p~0.base .cse3)))))) (forall ((v_main_~p~0.base_109 Int)) (or (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse4 c_main_~a~0.base) (= .cse4 v_main_~p~0.base_109) (= c_main_~p~0.base .cse4)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_main_~p~0.base_109 Int) (v_ArrVal_517 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (forall ((v_arrayElimArr_21 (Array Int Int))) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (= c_main_~a~0.offset .cse5) (= .cse5 0)))) (not (= (select v_arrayElimArr_21 .cse1) 0)))) (= v_main_~p~0.base_109 c_main_~a~0.base) (= .cse6 v_main_~p~0.base_109) (= c_main_~p~0.base .cse6)))) (or .cse7 (and (forall ((v_main_~p~0.base_109 Int)) (or (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_arrayElimArr_21 (Array Int Int))) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (= .cse8 c_main_~p~0.offset) (= c_main_~a~0.offset .cse8) (= .cse8 0)))) (not (= (select v_arrayElimArr_21 .cse1) 0)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) c_main_~a~0.base)) (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse9 c_main_~p~0.offset) (= .cse9 0)))))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse10 c_main_~p~0.offset) (= c_main_~a~0.offset .cse10) (= .cse10 0)))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) v_main_~p~0.base_109)) (= v_main_~p~0.base_109 c_main_~a~0.base))) (or (and (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse11 c_main_~p~0.offset) (= c_main_~a~0.offset .cse11) (= .cse11 0)))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) v_main_~p~0.base_109)))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) c_main_~a~0.base)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 4) 0)) (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse12 c_main_~p~0.offset) (= .cse12 0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_main_~p~0.base_109 Int) (v_ArrVal_517 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (forall ((v_arrayElimArr_21 (Array Int Int))) (or (forall ((v_ArrVal_518 (Array Int Int))) (= c_main_~a~0.offset (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (not (= (select v_arrayElimArr_21 .cse1) 0)))) (= .cse13 v_main_~p~0.base_109) (= c_main_~p~0.base .cse13)))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) v_main_~p~0.base_109)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse14 c_main_~p~0.offset) (= c_main_~a~0.offset .cse14)))))) (or .cse7 (and (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) c_main_~a~0.base)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse15 c_main_~p~0.offset) (= .cse15 0)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (= .cse16 c_main_~p~0.offset) (= c_main_~a~0.offset .cse16) (= .cse16 0)))) (not (= (select v_arrayElimArr_21 .cse1) 0)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse17 c_main_~a~0.base) (= .cse17 v_main_~p~0.base_109)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse18 c_main_~p~0.offset) (= .cse18 0)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= c_main_~p~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= c_main_~a~0.offset .cse19) (= .cse19 0)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (= .cse20 c_main_~p~0.offset) (= c_main_~a~0.offset .cse20) (= .cse20 0)))) (not (= (select v_arrayElimArr_21 4) 0)) (not (= (select v_arrayElimArr_21 .cse1) 0)))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse21 c_main_~p~0.offset) (= .cse21 0)))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse22 c_main_~a~0.base) (= c_main_~p~0.base .cse22)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse23 v_main_~p~0.base_109) (= c_main_~p~0.base .cse23)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= c_main_~a~0.offset (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_main_~p~0.base_109 Int) (v_ArrVal_517 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (forall ((v_arrayElimArr_21 (Array Int Int))) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (= c_main_~a~0.offset .cse24) (= .cse24 0)))) (not (= (select v_arrayElimArr_21 .cse1) 0)))) (= .cse25 v_main_~p~0.base_109) (= c_main_~p~0.base .cse25)))) (forall ((v_ArrVal_513 (Array Int Int)) (v_main_~p~0.base_109 Int) (v_ArrVal_517 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse26 c_main_~a~0.base) (= .cse26 v_main_~p~0.base_109) (= c_main_~p~0.base .cse26)))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0) 0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse27 c_main_~a~0.base) (= c_main_~p~0.base .cse27)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0) c_main_~p~0.offset))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse28 c_main_~a~0.base) (= .cse28 v_main_~p~0.base_109)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= c_main_~p~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse29 c_main_~p~0.offset) (= c_main_~a~0.offset .cse29) (= .cse29 0)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse30 c_main_~p~0.offset) (= c_main_~a~0.offset .cse30)))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse31 v_main_~p~0.base_109) (= c_main_~p~0.base .cse31))))))) (= c_main_~a~0.offset 0)) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse32 c_main_~a~0.base) (= .cse32 v_main_~p~0.base_109)))) (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse33 c_main_~p~0.offset) (= .cse33 0)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= c_main_~p~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= c_main_~a~0.offset .cse34) (= .cse34 0)))))) (forall ((v_main_~p~0.base_109 Int)) (or (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse35 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse35 v_main_~p~0.base_109) (= c_main_~p~0.base .cse35)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= c_main_~a~0.offset (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0)))))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0) v_main_~p~0.base_109)) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse36 c_main_~p~0.offset) (= c_main_~a~0.offset .cse36)))) (= v_main_~p~0.base_109 c_main_~a~0.base))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0) c_main_~p~0.offset))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse37 c_main_~a~0.base) (= .cse37 v_main_~p~0.base_109)))) (= v_main_~p~0.base_109 c_main_~a~0.base))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse38 c_main_~p~0.offset) (= c_main_~a~0.offset .cse38)))) (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse39 v_main_~p~0.base_109) (= c_main_~p~0.base .cse39)))))) (forall ((v_main_~p~0.base_109 Int)) (or (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse40 c_main_~p~0.offset) (= .cse40 0)))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= .cse41 c_main_~a~0.base) (= c_main_~p~0.base .cse41)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_main_~p~0.base_109 Int) (v_ArrVal_517 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (or (= v_main_~p~0.base_109 c_main_~a~0.base) (forall ((v_arrayElimArr_21 (Array Int Int))) (or (forall ((v_ArrVal_518 (Array Int Int))) (= c_main_~a~0.offset (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (not (= (select v_arrayElimArr_21 .cse1) 0)))) (= .cse42 v_main_~p~0.base_109) (= c_main_~p~0.base .cse42)))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_arrayElimArr_21 (Array Int Int))) (or (forall ((v_ArrVal_518 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (= .cse43 c_main_~p~0.offset) (= c_main_~a~0.offset .cse43) (= .cse43 0)))) (not (= (select v_arrayElimArr_21 4) 0)) (not (= (select v_arrayElimArr_21 .cse1) 0)))) (= v_main_~p~0.base_109 c_main_~a~0.base))) (forall ((v_main_~p~0.base_109 Int)) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_517 (Array Int Int))) (= c_main_~p~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_513) v_main_~p~0.base_109 v_ArrVal_517) c_main_~a~0.base) .cse0))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_518 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_arrayElimArr_21) v_main_~p~0.base_109 v_ArrVal_518) c_main_~a~0.base) .cse0))) (or (not (= (select v_arrayElimArr_21 .cse1) 0)) (= .cse44 c_main_~p~0.offset) (= c_main_~a~0.offset .cse44) (= .cse44 0)))) (= v_main_~p~0.base_109 c_main_~a~0.base))))) is different from false [2023-03-31 22:48:37,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,289 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 25 treesize of output 26 [2023-03-31 22:48:37,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,296 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 51 treesize of output 41 [2023-03-31 22:48:37,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:37,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-03-31 22:48:37,312 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 23 treesize of output 15 [2023-03-31 22:48:37,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:37,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-03-31 22:48:37,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,338 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 20 treesize of output 20 [2023-03-31 22:48:37,360 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,360 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 51 treesize of output 1 [2023-03-31 22:48:37,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2023-03-31 22:48:37,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,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 51 treesize of output 41 [2023-03-31 22:48:37,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:37,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:37,386 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 25 treesize of output 19 [2023-03-31 22:48:37,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:37,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-03-31 22:48:37,404 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 23 treesize of output 15 [2023-03-31 22:48:37,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:37,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-03-31 22:48:37,434 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,434 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 51 treesize of output 1 [2023-03-31 22:48:37,444 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,444 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 25 treesize of output 1 [2023-03-31 22:48:37,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,451 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 76 treesize of output 56 [2023-03-31 22:48:37,455 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:37,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 73 [2023-03-31 22:48:37,469 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 34 treesize of output 22 [2023-03-31 22:48:37,490 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,490 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 76 treesize of output 1 [2023-03-31 22:48:37,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,508 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 25 treesize of output 26 [2023-03-31 22:48:37,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:37,517 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 1 case distinctions, treesize of input 51 treesize of output 41 [2023-03-31 22:48:37,520 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 22:48:37,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:37,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:37,526 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2023-03-31 22:48:37,531 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 7 treesize of output 3 [2023-03-31 22:48:37,535 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 10 treesize of output 4 [2023-03-31 22:48:37,538 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 15 treesize of output 7 [2023-03-31 22:48:37,542 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 8 treesize of output 4 [2023-03-31 22:48:37,551 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,552 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 23 treesize of output 1 [2023-03-31 22:48:37,557 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-03-31 22:48:37,563 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-03-31 22:48:37,568 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-03-31 22:48:37,577 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,578 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 47 treesize of output 1 [2023-03-31 22:48:37,591 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,591 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 1 case distinctions, treesize of input 47 treesize of output 1 [2023-03-31 22:48:37,599 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,599 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 1 case distinctions, treesize of input 47 treesize of output 1 [2023-03-31 22:48:37,608 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,609 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 47 treesize of output 1 [2023-03-31 22:48:37,614 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-03-31 22:48:37,623 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-03-31 22:48:37,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2023-03-31 22:48:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-03-31 22:48:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441698133] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 22:48:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2097428863] [2023-03-31 22:48:37,830 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-03-31 22:48:37,830 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 22:48:37,830 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 22:48:37,830 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 22:48:37,830 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 22:48:37,844 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 23 for LOIs [2023-03-31 22:48:38,015 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 22:48:38,018 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 22:48:38,379 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse0 (exists ((|v_#memory_$Pointer$.offset_117| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_117| c_main_~p~0.base (store (select |v_#memory_$Pointer$.offset_117| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.offset| c_main_~p~0.base) c_main_~p~0.offset)))))) (.cse1 (= 0 c_main_~flag~0)) (.cse2 (exists ((|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_119| c_main_~p~0.base (store (select |v_#memory_$Pointer$.base_119| c_main_~p~0.base) c_main_~p~0.offset (select (select |c_#memory_$Pointer$.base| c_main_~p~0.base) c_main_~p~0.offset))))))) (or (and .cse0 (not .cse1) (exists ((|v_#memory_int_120| (Array Int (Array Int Int)))) (= (store |v_#memory_int_120| c_main_~p~0.base (store (select |v_#memory_int_120| c_main_~p~0.base) c_main_~p~0.offset 1)) |c_#memory_int|)) .cse2) (and .cse0 (exists ((|v_#memory_int_120| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_120| c_main_~p~0.base (store (select |v_#memory_int_120| c_main_~p~0.base) c_main_~p~0.offset 2)))) .cse1 .cse2))) (exists ((|v_#length_68| (Array Int Int))) (= (store |v_#length_68| c_main_~t~0.base 8) |c_#length|)) (exists ((|v_main_#t~nondet5_60| Int)) (and (let ((.cse3 (<= |v_main_#t~nondet5_60| 2147483647)) (.cse4 (<= 0 (+ |v_main_#t~nondet5_60| 2147483648)))) (or (and .cse3 .cse4) (and (= c_main_~p~0.offset 0) (<= 0 (+ 2147483648 c_main_~flag~0)) (= |c_#NULL.offset| 0) .cse3 (= c_main_~a~0.offset 0) (= |c_#NULL.base| 0) (<= c_main_~flag~0 2147483647) .cse4 (<= 0 |c_#StackHeapBarrier|)))) (not (= |v_main_#t~nondet5_60| 0)))) (= c_main_~t~0.offset 0) (not (= c_main_~t~0.base 0)) (< c_main_~t~0.base |c_#StackHeapBarrier|) (exists ((|v_#valid_76| (Array Int Int))) (and (= (select |v_#valid_76| c_main_~t~0.base) 0) (= |c_#valid| (store |v_#valid_76| c_main_~t~0.base 1))))) is different from true [2023-03-31 22:48:38,611 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2426#(and (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 1)) (not (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)))' at error location [2023-03-31 22:48:38,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 22:48:38,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 22:48:38,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 36 [2023-03-31 22:48:38,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005395753] [2023-03-31 22:48:38,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 22:48:38,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-03-31 22:48:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 22:48:38,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-03-31 22:48:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1997, Unknown=11, NotChecked=182, Total=2352 [2023-03-31 22:48:38,614 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 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-03-31 22:48:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 22:48:40,856 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2023-03-31 22:48:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-03-31 22:48:40,857 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 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 26 [2023-03-31 22:48:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 22:48:40,857 INFO L225 Difference]: With dead ends: 71 [2023-03-31 22:48:40,858 INFO L226 Difference]: Without dead ends: 67 [2023-03-31 22:48:40,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=359, Invalid=3415, Unknown=16, NotChecked=242, Total=4032 [2023-03-31 22:48:40,859 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 259 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-31 22:48:40,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 325 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 528 Invalid, 0 Unknown, 66 Unchecked, 0.4s Time] [2023-03-31 22:48:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-03-31 22:48:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 41. [2023-03-31 22:48:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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-03-31 22:48:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-03-31 22:48:40,870 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 26 [2023-03-31 22:48:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 22:48:40,871 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-03-31 22:48:40,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 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-03-31 22:48:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-03-31 22:48:40,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-03-31 22:48:40,875 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 22:48:40,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 22:48:40,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-31 22:48:41,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:41,076 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 22:48:41,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 22:48:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash 224328982, now seen corresponding path program 4 times [2023-03-31 22:48:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 22:48:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994328773] [2023-03-31 22:48:41,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 22:48:41,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 22:48:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:41,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 22:48:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994328773] [2023-03-31 22:48:41,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994328773] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 22:48:41,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767326713] [2023-03-31 22:48:41,970 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-03-31 22:48:41,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 22:48:41,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 22:48:41,973 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 22:48:41,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-03-31 22:48:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 22:48:42,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 60 conjunts are in the unsatisfiable core [2023-03-31 22:48:42,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 22:48:42,123 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-03-31 22:48:42,158 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-31 22:48:42,158 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-03-31 22:48:42,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-31 22:48:42,226 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-03-31 22:48:42,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 59 [2023-03-31 22:48:42,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 22:48:42,297 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 48 treesize of output 50 [2023-03-31 22:48:42,310 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 22:48:42,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2023-03-31 22:48:42,327 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-03-31 22:48:42,328 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-03-31 22:48:42,415 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-03-31 22:48:42,415 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 1 case distinctions, treesize of input 101 treesize of output 75 [2023-03-31 22:48:42,422 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 100 treesize of output 82 [2023-03-31 22:48:42,514 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-03-31 22:48:42,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 117 [2023-03-31 22:48:42,536 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-03-31 22:48:42,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 112 [2023-03-31 22:48:42,540 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2023-03-31 22:48:42,678 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-03-31 22:48:42,678 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 49 [2023-03-31 22:48:42,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-03-31 22:48:42,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 22:48:42,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 22:48:42,770 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 187 treesize of output 129 [2023-03-31 22:48:42,779 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~a~0.offset 4))) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= c_main_~p~0.base (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_615))) (select .cse0 (select (select .cse0 c_main_~a~0.base) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_616) c_main_~a~0.base) .cse1) 4)))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_main_~p~0.base v_ArrVal_616))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| c_main_~p~0.base v_ArrVal_615) c_main_~a~0.base) .cse1)) (+ (select (select .cse2 c_main_~a~0.base) .cse1) 4))) c_main_~p~0.offset)))) is different from false [2023-03-31 22:48:42,819 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_main_~p~0.offset 4))) (let ((.cse2 (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) .cse4 c_main_~t~0.base))) (.cse1 (+ c_main_~a~0.offset 4)) (.cse3 (select |c_#memory_$Pointer$.offset| c_main_~p~0.base))) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_main_~p~0.offset_121 Int)) (= (select (let ((.cse0 (store .cse2 c_main_~t~0.base v_ArrVal_615))) (select .cse0 (select (select .cse0 c_main_~a~0.base) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base (store .cse3 .cse4 v_main_~p~0.offset_121)) c_main_~t~0.base v_ArrVal_616) c_main_~a~0.base) .cse1) 4)) c_main_~t~0.base)) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_main_~p~0.offset_121 Int)) (= v_main_~p~0.offset_121 (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| c_main_~p~0.base (store .cse3 .cse4 v_main_~p~0.offset_121)) c_main_~t~0.base v_ArrVal_616))) (select (select .cse5 (select (select (store .cse2 c_main_~t~0.base v_ArrVal_615) c_main_~a~0.base) .cse1)) (+ (select (select .cse5 c_main_~a~0.base) .cse1) 4)))))))) is different from false [2023-03-31 22:48:42,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 52 treesize of output 68 [2023-03-31 22:48:42,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 124 [2023-03-31 22:48:42,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:42,878 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 98 treesize of output 92 [2023-03-31 22:48:42,902 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 13 treesize of output 1 [2023-03-31 22:48:43,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:43,029 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 85 treesize of output 86 [2023-03-31 22:48:43,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:43,036 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 75 treesize of output 66 [2023-03-31 22:48:43,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:43,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 2642 treesize of output 1799 [2023-03-31 22:48:43,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:43,158 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 2920 treesize of output 2745 [2023-03-31 22:48:43,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:43,232 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 988 treesize of output 776 [2023-03-31 22:48:43,251 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 601 treesize of output 505 [2023-03-31 22:48:43,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:43,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 480 treesize of output 480 [2023-03-31 22:48:43,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 22:48:43,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 430 treesize of output 418