/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:02:25,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:02:25,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:02:25,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:02:25,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:02:25,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:02:25,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:02:25,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:02:25,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:02:25,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:02:25,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:02:25,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:02:25,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:02:25,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:02:25,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:02:25,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:02:25,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:02:25,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:02:25,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:02:25,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:02:25,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:02:25,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:02:25,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:02:25,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:02:25,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:02:25,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:02:25,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:02:25,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:02:25,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:02:25,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:02:25,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:02:25,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:02:25,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:02:25,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:02:25,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:02:25,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:02:25,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:02:25,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:02:25,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:02:25,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:02:25,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:02:25,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 01:02:25,299 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:02:25,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:02:25,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:02:25,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:02:25,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:02:25,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:02:25,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:02:25,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:02:25,301 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:02:25,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:02:25,301 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:02:25,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:02:25,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:02:25,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:02:25,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:02:25,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:02:25,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:02:25,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:02:25,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:02:25,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:02:25,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:02:25,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:02:25,304 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:02:25,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:02:25,304 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:02:25,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:02:25,304 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:02:25,304 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-04-02 01:02:25,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:02:25,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:02:25,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:02:25,540 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:02:25,540 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:02:25,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-04-02 01:02:26,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:02:27,051 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:02:27,052 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-1.i [2023-04-02 01:02:27,065 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6e35408/cc6eb928c3354a258bf90e245d2f6eda/FLAGe53814613 [2023-04-02 01:02:27,077 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6e35408/cc6eb928c3354a258bf90e245d2f6eda [2023-04-02 01:02:27,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:02:27,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:02:27,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:02:27,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:02:27,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:02:27,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9d620e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27, skipping insertion in model container [2023-04-02 01:02:27,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:02:27,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:02:27,386 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-ext2-properties/simple_search_value-1.i[23210,23223] [2023-04-02 01:02:27,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:02:27,400 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:02:27,450 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-ext2-properties/simple_search_value-1.i[23210,23223] [2023-04-02 01:02:27,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:02:27,477 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:02:27,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27 WrapperNode [2023-04-02 01:02:27,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:02:27,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:02:27,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:02:27,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:02:27,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,535 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:02:27,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:02:27,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:02:27,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:02:27,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (1/1) ... [2023-04-02 01:02:27,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:02:27,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:02:27,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-02 01:02:27,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-02 01:02:27,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:02:27,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:02:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:02:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2023-04-02 01:02:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2023-04-02 01:02:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-04-02 01:02:27,609 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:02:27,609 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:02:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:02:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-02 01:02:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-02 01:02:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:02:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:02:27,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-04-02 01:02:27,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2023-04-02 01:02:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-04-02 01:02:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-04-02 01:02:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-04-02 01:02:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-04-02 01:02:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-04-02 01:02:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-04-02 01:02:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-04-02 01:02:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-04-02 01:02:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-04-02 01:02:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-04-02 01:02:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-04-02 01:02:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-04-02 01:02:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-04-02 01:02:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-04-02 01:02:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-04-02 01:02:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-04-02 01:02:27,616 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-02 01:02:27,617 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-04-02 01:02:27,618 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-04-02 01:02:27,619 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-04-02 01:02:27,620 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-04-02 01:02:27,621 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:02:27,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:02:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:02:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:02:27,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:02:27,790 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:02:27,792 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:02:27,844 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-04-02 01:02:27,995 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:02:28,000 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:02:28,001 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-04-02 01:02:28,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:02:28 BoogieIcfgContainer [2023-04-02 01:02:28,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:02:28,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:02:28,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:02:28,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:02:28,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:02:27" (1/3) ... [2023-04-02 01:02:28,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b1f29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:02:28, skipping insertion in model container [2023-04-02 01:02:28,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:02:27" (2/3) ... [2023-04-02 01:02:28,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b1f29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:02:28, skipping insertion in model container [2023-04-02 01:02:28,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:02:28" (3/3) ... [2023-04-02 01:02:28,010 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2023-04-02 01:02:28,025 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:02:28,025 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:02:28,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:02:28,075 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@47fa3213, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:02:28,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:02:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 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-04-02 01:02:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-02 01:02:28,084 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:28,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:02:28,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:28,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1694508045, now seen corresponding path program 1 times [2023-04-02 01:02:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:28,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868452256] [2023-04-02 01:02:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:02:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868452256] [2023-04-02 01:02:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868452256] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:02:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:02:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-02 01:02:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60884213] [2023-04-02 01:02:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:02:28,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-02 01:02:28,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:28,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-02 01:02:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 01:02:28,404 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:02:28,512 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-04-02 01:02:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-02 01:02:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (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) Word has length 13 [2023-04-02 01:02:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:02:28,523 INFO L225 Difference]: With dead ends: 45 [2023-04-02 01:02:28,523 INFO L226 Difference]: Without dead ends: 22 [2023-04-02 01:02:28,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-02 01:02:28,531 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:02:28,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 10 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:02:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-04-02 01:02:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-04-02 01:02:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-04-02 01:02:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-04-02 01:02:28,560 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2023-04-02 01:02:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:02:28,560 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-04-02 01:02:28,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-04-02 01:02:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 01:02:28,561 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:28,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:02:28,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-02 01:02:28,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:28,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:28,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1420943426, now seen corresponding path program 1 times [2023-04-02 01:02:28,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:28,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428333473] [2023-04-02 01:02:28,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:28,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:02:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428333473] [2023-04-02 01:02:28,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428333473] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:02:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:02:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 01:02:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209816117] [2023-04-02 01:02:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:02:28,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 01:02:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:28,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 01:02:28,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 01:02:28,632 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:02:28,681 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-04-02 01:02:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 01:02:28,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 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) Word has length 15 [2023-04-02 01:02:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:02:28,682 INFO L225 Difference]: With dead ends: 32 [2023-04-02 01:02:28,682 INFO L226 Difference]: Without dead ends: 23 [2023-04-02 01:02:28,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:02:28,683 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:02:28,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:02:28,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-04-02 01:02:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-04-02 01:02:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-04-02 01:02:28,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2023-04-02 01:02:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:02:28,690 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-04-02 01:02:28,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-04-02 01:02:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-02 01:02:28,690 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:28,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:02:28,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-02 01:02:28,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:28,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1363685124, now seen corresponding path program 1 times [2023-04-02 01:02:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:28,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703093196] [2023-04-02 01:02:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:28,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:02:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703093196] [2023-04-02 01:02:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703093196] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:02:28,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:02:28,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 01:02:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258947269] [2023-04-02 01:02:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:02:28,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 01:02:28,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 01:02:28,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:02:28,836 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:02:28,944 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2023-04-02 01:02:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:02:28,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 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) Word has length 15 [2023-04-02 01:02:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:02:28,946 INFO L225 Difference]: With dead ends: 43 [2023-04-02 01:02:28,946 INFO L226 Difference]: Without dead ends: 28 [2023-04-02 01:02:28,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:02:28,952 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:02:28,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 17 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:02:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-02 01:02:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-04-02 01:02:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-04-02 01:02:28,965 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2023-04-02 01:02:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:02:28,965 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-04-02 01:02:28,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-04-02 01:02:28,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-02 01:02:28,966 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:28,967 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-04-02 01:02:28,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-02 01:02:28,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:28,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1207953937, now seen corresponding path program 1 times [2023-04-02 01:02:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677597332] [2023-04-02 01:02:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 01:02:29,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677597332] [2023-04-02 01:02:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677597332] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:02:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:02:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 01:02:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103874895] [2023-04-02 01:02:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:02:29,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 01:02:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 01:02:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:02:29,113 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:02:29,187 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-04-02 01:02:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 01:02:29,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 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) Word has length 20 [2023-04-02 01:02:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:02:29,190 INFO L225 Difference]: With dead ends: 36 [2023-04-02 01:02:29,190 INFO L226 Difference]: Without dead ends: 33 [2023-04-02 01:02:29,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-04-02 01:02:29,198 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:02:29,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 17 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:02:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-04-02 01:02:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-04-02 01:02:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-04-02 01:02:29,209 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2023-04-02 01:02:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:02:29,209 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-04-02 01:02:29,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-04-02 01:02:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-02 01:02:29,210 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:29,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:02:29,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-02 01:02:29,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:29,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2125466140, now seen corresponding path program 1 times [2023-04-02 01:02:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:29,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341590321] [2023-04-02 01:02:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-02 01:02:29,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:29,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341590321] [2023-04-02 01:02:29,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341590321] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:02:29,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:02:29,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:02:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619060973] [2023-04-02 01:02:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:02:29,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:02:29,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:29,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:02:29,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:02:29,340 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:02:29,435 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-04-02 01:02:29,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:02:29,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 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) Word has length 25 [2023-04-02 01:02:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:02:29,438 INFO L225 Difference]: With dead ends: 37 [2023-04-02 01:02:29,438 INFO L226 Difference]: Without dead ends: 29 [2023-04-02 01:02:29,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:02:29,439 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:02:29,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:02:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-02 01:02:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-04-02 01:02:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-04-02 01:02:29,450 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2023-04-02 01:02:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:02:29,450 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-04-02 01:02:29,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-04-02 01:02:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-02 01:02:29,451 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:29,452 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:02:29,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-02 01:02:29,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:29,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2123619098, now seen corresponding path program 1 times [2023-04-02 01:02:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977884755] [2023-04-02 01:02:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:02:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977884755] [2023-04-02 01:02:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977884755] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:02:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627758020] [2023-04-02 01:02:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:29,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:02:29,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:02:29,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:02:29,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-02 01:02:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:29,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-02 01:02:29,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:02:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:02:29,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:02:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:02:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627758020] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:02:29,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:02:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-04-02 01:02:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019357131] [2023-04-02 01:02:29,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:02:29,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-02 01:02:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-02 01:02:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-04-02 01:02:29,805 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:02:29,972 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2023-04-02 01:02:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-02 01:02:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-04-02 01:02:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:02:29,973 INFO L225 Difference]: With dead ends: 64 [2023-04-02 01:02:29,973 INFO L226 Difference]: Without dead ends: 46 [2023-04-02 01:02:29,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2023-04-02 01:02:29,975 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:02:29,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 22 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:02:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-04-02 01:02:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-04-02 01:02:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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-04-02 01:02:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-04-02 01:02:29,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2023-04-02 01:02:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:02:29,988 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-04-02 01:02:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-04-02 01:02:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-02 01:02:29,989 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:29,989 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:02:29,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-02 01:02:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-04-02 01:02:30,195 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:30,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 940793499, now seen corresponding path program 2 times [2023-04-02 01:02:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443023344] [2023-04-02 01:02:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:02:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443023344] [2023-04-02 01:02:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443023344] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:02:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31964875] [2023-04-02 01:02:30,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:02:30,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:02:30,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:02:30,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:02:30,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-02 01:02:30,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:02:30,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:02:30,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 01:02:30,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:02:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:02:30,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:02:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:02:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31964875] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:02:30,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:02:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2023-04-02 01:02:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925774569] [2023-04-02 01:02:30,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:02:30,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-02 01:02:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:30,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-02 01:02:30,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2023-04-02 01:02:30,787 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:31,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:02:31,163 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2023-04-02 01:02:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-02 01:02:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2023-04-02 01:02:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:02:31,164 INFO L225 Difference]: With dead ends: 94 [2023-04-02 01:02:31,164 INFO L226 Difference]: Without dead ends: 76 [2023-04-02 01:02:31,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=423, Invalid=837, Unknown=0, NotChecked=0, Total=1260 [2023-04-02 01:02:31,166 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:02:31,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 37 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:02:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-04-02 01:02:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2023-04-02 01:02:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2023-04-02 01:02:31,173 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 40 [2023-04-02 01:02:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:02:31,173 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2023-04-02 01:02:31,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 14 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2023-04-02 01:02:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-04-02 01:02:31,174 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:02:31,174 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:02:31,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-02 01:02:31,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-04-02 01:02:31,382 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:02:31,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:02:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -358091973, now seen corresponding path program 3 times [2023-04-02 01:02:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:02:31,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695980677] [2023-04-02 01:02:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:02:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:02:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:02:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:02:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-04-02 01:02:34,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:02:34,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695980677] [2023-04-02 01:02:34,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695980677] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:02:34,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955459832] [2023-04-02 01:02:34,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:02:34,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:02:34,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:02:34,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:02:34,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-02 01:02:43,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-04-02 01:02:43,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:02:43,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 162 conjunts are in the unsatisfiable core [2023-04-02 01:02:43,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:02:43,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:02:43,340 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-02 01:02:43,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-04-02 01:02:43,387 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 11 treesize of output 7 [2023-04-02 01:02:43,443 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:02:43,444 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 30 treesize of output 28 [2023-04-02 01:02:43,504 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-04-02 01:02:43,505 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 27 treesize of output 28 [2023-04-02 01:02:43,560 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:43,561 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 23 treesize of output 27 [2023-04-02 01:02:43,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-02 01:02:43,660 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:43,660 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 33 treesize of output 32 [2023-04-02 01:02:43,720 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:43,721 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 15 treesize of output 21 [2023-04-02 01:02:43,794 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:43,794 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 24 treesize of output 27 [2023-04-02 01:02:43,831 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:43,831 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 15 treesize of output 21 [2023-04-02 01:02:43,882 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:43,882 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 24 treesize of output 27 [2023-04-02 01:02:43,947 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:43,948 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 15 treesize of output 21 [2023-04-02 01:02:44,031 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:44,031 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 24 treesize of output 27 [2023-04-02 01:02:44,073 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:44,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-04-02 01:02:44,118 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:44,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 24 treesize of output 27 [2023-04-02 01:02:44,162 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:44,162 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 15 treesize of output 21 [2023-04-02 01:02:44,204 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:44,205 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 24 treesize of output 27 [2023-04-02 01:02:44,260 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:44,260 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 15 treesize of output 21 [2023-04-02 01:02:44,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:02:44,346 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:44,346 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 19 treesize of output 25 [2023-04-02 01:02:44,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-04-02 01:02:44,484 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-04-02 01:02:44,485 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 35 treesize of output 56 [2023-04-02 01:02:44,501 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:44,501 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 31 treesize of output 37 [2023-04-02 01:02:44,550 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 5 [2023-04-02 01:02:44,581 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 5 [2023-04-02 01:02:44,616 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 5 [2023-04-02 01:02:44,710 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:02:44,710 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 28 treesize of output 34 [2023-04-02 01:02:44,724 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:44,727 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 31 treesize of output 34 [2023-04-02 01:02:44,957 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-04-02 01:02:44,957 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 42 treesize of output 49 [2023-04-02 01:02:44,997 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-04-02 01:02:44,998 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 30 treesize of output 51 [2023-04-02 01:02:45,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:45,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2023-04-02 01:02:45,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-04-02 01:02:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-04-02 01:02:45,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:02:45,434 WARN L839 $PredicateComparison]: unable to prove that (forall ((main_~p~0.base Int)) (or (forall ((v_ArrVal_644 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| main_~p~0.base v_ArrVal_644) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 0))) (forall ((v_ArrVal_646 Int) (v_ArrVal_645 Int)) (or (< v_ArrVal_646 c_main_~counter~0) (< 2 (select (select (store |c_#memory_int| main_~p~0.base (store (store (select |c_#memory_int| main_~p~0.base) c_main_~p~0.offset v_ArrVal_646) (+ c_main_~p~0.offset 4) v_ArrVal_645)) c_main_~a~0.base) c_main_~a~0.offset)))))) is different from false [2023-04-02 01:02:45,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:45,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-04-02 01:02:46,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:46,162 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 50 treesize of output 43 [2023-04-02 01:02:46,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:46,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 301 treesize of output 307 [2023-04-02 01:02:46,208 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 200 treesize of output 192 [2023-04-02 01:02:46,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-02 01:02:46,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-04-02 01:02:46,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:46,368 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 251 treesize of output 247 [2023-04-02 01:02:46,997 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-04-02 01:02:47,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:47,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-04-02 01:02:47,944 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-04-02 01:02:47,967 WARN L839 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_arrayElimArr_3 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_main_~p~0.base_38 Int) (v_ArrVal_644 (Array Int Int)) (main_~p~0.base Int) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| main_~p~0.base v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= c_main_~a~0.base v_subst_1) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37))) (= (select v_arrayElimArr_3 (+ c_main_~p~0.offset 4)) 0)))) is different from false [2023-04-02 01:02:48,046 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select v_arrayElimArr_3 (+ c_main_~t~0.offset 4)) 0) (forall ((v_ArrVal_634 (Array Int Int)) (v_main_~p~0.base_38 Int) (v_ArrVal_644 (Array Int Int)) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_subst_5 Int) (v_subst_1 Int)) (or (= c_main_~a~0.base v_subst_1) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) (+ c_main_~p~0.offset 4) c_main_~t~0.base)) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)))))) (= c_main_~a~0.offset 0)) is different from false [2023-04-02 01:02:48,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:48,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2023-04-02 01:02:48,131 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-04-02 01:02:48,139 WARN L839 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_main_~p~0.base_38 Int) (v_ArrVal_644 (Array Int Int)) (main_~p~0.base Int) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int) (v_subst_1 Int)) (or (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| main_~p~0.base v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= c_main_~a~0.base v_subst_1) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_4 (+ c_main_~p~0.offset 4)) 0)))) is different from false [2023-04-02 01:02:48,237 WARN L839 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_main_~p~0.base_38 Int) (v_ArrVal_644 (Array Int Int)) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (= c_main_~a~0.base v_subst_1) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) (+ c_main_~p~0.offset 4) c_main_~t~0.base)) v_subst_6 v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_4 (+ c_main_~t~0.offset 4)) 0)))) is different from false [2023-04-02 01:02:48,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:48,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2023-04-02 01:02:48,320 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-04-02 01:02:48,356 WARN L839 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_main_~p~0.base_38 Int) (v_ArrVal_644 (Array Int Int)) (main_~p~0.base Int) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (= c_main_~a~0.base v_subst_1) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| main_~p~0.base v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_5 (+ c_main_~p~0.offset 4)) 0)))) is different from false [2023-04-02 01:02:48,515 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (forall ((v_ArrVal_634 (Array Int Int)) (v_main_~p~0.base_38 Int) (v_ArrVal_644 (Array Int Int)) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_subst_7 Int) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_1 Int)) (or (= c_main_~a~0.base v_subst_1) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) (+ c_main_~p~0.offset 4) c_main_~t~0.base)) v_subst_7 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_5 (+ c_main_~t~0.offset 4)) 0))) (= c_main_~a~0.offset 0)) is different from false [2023-04-02 01:02:48,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:48,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 72 [2023-04-02 01:02:48,627 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-04-02 01:02:48,654 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (= (select v_arrayElimArr_6 (+ c_main_~p~0.offset 4)) 0) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_main_~p~0.base_38 Int) (main_~p~0.base Int) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_1 Int) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_subst_7 Int)) (or (= (select v_arrayElimArr_5 4) 0) (= c_main_~a~0.base v_subst_1) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| main_~p~0.base v_arrayElimArr_6) v_subst_7 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))))) (= c_main_~a~0.offset 0)) is different from false [2023-04-02 01:02:49,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:49,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 80 [2023-04-02 01:02:49,113 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-04-02 01:02:49,197 WARN L839 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (= (select v_arrayElimArr_7 (+ c_main_~p~0.offset 4)) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_main_~p~0.base_38 Int) (main_~p~0.base Int) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_1 Int) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_subst_8 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= c_main_~a~0.base v_subst_1) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_4 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| main_~p~0.base v_arrayElimArr_7) v_subst_8 v_arrayElimArr_6) v_subst_7 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= (select v_arrayElimArr_3 4) 0)))))) is different from false [2023-04-02 01:02:49,398 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (= (select v_arrayElimArr_7 (+ c_main_~t~0.offset 4)) 0) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_main_~p~0.base_38 Int) (v_main_~p~0.base_37 Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_1 Int) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= c_main_~a~0.base v_subst_1) (= v_main_~p~0.base_37 c_main_~a~0.base) (= (select v_arrayElimArr_1 4) 0) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_4 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| c_main_~p~0.base (store (select |c_#memory_$Pointer$.base| c_main_~p~0.base) (+ c_main_~p~0.offset 4) c_main_~t~0.base)) v_subst_9 v_arrayElimArr_7) v_subst_8 v_arrayElimArr_6) v_subst_7 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= (select v_arrayElimArr_3 4) 0))))) (= c_main_~a~0.offset 0)) is different from false [2023-04-02 01:02:49,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:49,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 88 [2023-04-02 01:02:49,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-04-02 01:02:49,581 WARN L839 $PredicateComparison]: unable to prove that (and (= c_main_~a~0.offset 0) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_main_~p~0.base_38 Int) (main_~p~0.base Int) (v_main_~p~0.base_37 Int) (v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int) (v_subst_5 Int) (v_subst_1 Int) (v_ArrVal_634 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (v_subst_9 Int) (v_subst_8 Int) (v_subst_7 Int)) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= c_main_~a~0.base v_subst_1) (= v_main_~p~0.base_37 c_main_~a~0.base) (= 0 (select v_arrayElimArr_7 4)) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| main_~p~0.base v_arrayElimArr_8) v_subst_9 v_arrayElimArr_7) v_subst_8 v_arrayElimArr_6) v_subst_7 v_arrayElimArr_5) v_subst_6 v_arrayElimArr_4) v_subst_5 v_arrayElimArr_3) v_subst_1 v_ArrVal_634) v_main_~p~0.base_38 v_arrayElimArr_1) v_main_~p~0.base_37 v_ArrVal_644) c_main_~a~0.base) 4) 0)) (= v_main_~p~0.base_38 v_main_~p~0.base_37) (= (select v_arrayElimArr_4 4) 0) (= (select v_arrayElimArr_3 4) 0))) (= (select v_arrayElimArr_8 (+ c_main_~p~0.offset 4)) 0)))) is different from false [2023-04-02 01:02:51,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:51,010 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 48 treesize of output 49 [2023-04-02 01:02:51,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:02:51,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-02 01:02:51,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:02:51,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134283265 treesize of output 134152198 [2023-04-02 01:02:52,202 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 32 treesize of output 30 [2023-04-02 01:02:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 53 refuted. 4 times theorem prover too weak. 0 trivial. 199 not checked. [2023-04-02 01:02:52,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955459832] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:02:52,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-02 01:02:52,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 30] total 57 [2023-04-02 01:02:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321890411] [2023-04-02 01:02:52,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-02 01:02:52,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-04-02 01:02:52,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:02:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-04-02 01:02:52,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1847, Unknown=82, NotChecked=1078, Total=3192 [2023-04-02 01:02:52,412 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 57 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 56 states have internal predecessors, (133), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:02:56,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-04-02 01:03:15,073 WARN L223 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 233 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:03:26,678 WARN L223 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 195 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:03:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:03:31,679 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2023-04-02 01:03:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-02 01:03:31,680 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 56 states have internal predecessors, (133), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2023-04-02 01:03:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:03:31,681 INFO L225 Difference]: With dead ends: 106 [2023-04-02 01:03:31,681 INFO L226 Difference]: Without dead ends: 88 [2023-04-02 01:03:31,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 11 IntricatePredicates, 3 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=774, Invalid=3478, Unknown=82, NotChecked=1518, Total=5852 [2023-04-02 01:03:31,683 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 301 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 81 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 537 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-04-02 01:03:31,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 155 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 652 Invalid, 1 Unknown, 537 Unchecked, 2.6s Time] [2023-04-02 01:03:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-04-02 01:03:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2023-04-02 01:03:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 78 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:03:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-04-02 01:03:31,692 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 70 [2023-04-02 01:03:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:03:31,692 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-04-02 01:03:31,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 56 states have internal predecessors, (133), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:03:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-04-02 01:03:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 01:03:31,693 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:03:31,693 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:03:31,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-02 01:03:31,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:03:31,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:03:31,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:03:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 299740796, now seen corresponding path program 1 times [2023-04-02 01:03:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:03:31,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876367963] [2023-04-02 01:03:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:03:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:03:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:03:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:03:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:03:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-04-02 01:03:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:03:32,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876367963] [2023-04-02 01:03:32,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876367963] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:03:32,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:03:32,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 01:03:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165744853] [2023-04-02 01:03:32,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:03:32,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 01:03:32,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:03:32,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 01:03:32,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-02 01:03:32,054 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:03:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:03:32,126 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2023-04-02 01:03:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 01:03:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 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) Word has length 75 [2023-04-02 01:03:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:03:32,131 INFO L225 Difference]: With dead ends: 102 [2023-04-02 01:03:32,131 INFO L226 Difference]: Without dead ends: 92 [2023-04-02 01:03:32,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-04-02 01:03:32,133 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:03:32,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:03:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-04-02 01:03:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2023-04-02 01:03:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:03:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-04-02 01:03:32,154 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 75 [2023-04-02 01:03:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:03:32,154 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-04-02 01:03:32,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:03:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-04-02 01:03:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-04-02 01:03:32,158 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:03:32,158 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:03:32,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-04-02 01:03:32,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:03:32,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:03:32,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2072901116, now seen corresponding path program 1 times [2023-04-02 01:03:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:03:32,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673034007] [2023-04-02 01:03:32,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:03:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:03:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:03:34,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-02 01:03:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:03:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 5 proven. 91 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2023-04-02 01:03:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:03:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673034007] [2023-04-02 01:03:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673034007] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-02 01:03:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557893399] [2023-04-02 01:03:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:03:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:03:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:03:34,787 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-04-02 01:03:34,788 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-04-02 01:03:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:03:35,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 184 conjunts are in the unsatisfiable core [2023-04-02 01:03:35,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:03:35,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-04-02 01:03:35,166 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-04-02 01:03:35,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-04-02 01:03:35,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:03:35,242 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 19 treesize of output 18 [2023-04-02 01:03:35,247 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-04-02 01:03:35,307 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 14 treesize of output 16 [2023-04-02 01:03:35,313 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 14 treesize of output 16 [2023-04-02 01:03:35,338 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-04-02 01:03:35,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-04-02 01:03:35,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,492 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 14 treesize of output 16 [2023-04-02 01:03:35,518 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-04-02 01:03:35,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-04-02 01:03:35,533 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 14 treesize of output 16 [2023-04-02 01:03:35,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,730 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-04-02 01:03:35,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-04-02 01:03:35,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:35,987 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 14 treesize of output 16 [2023-04-02 01:03:36,029 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-04-02 01:03:36,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-04-02 01:03:36,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:36,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:36,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:36,331 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 14 treesize of output 16 [2023-04-02 01:03:36,380 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-04-02 01:03:36,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-04-02 01:03:36,418 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 14 treesize of output 16 [2023-04-02 01:03:36,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:36,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:36,715 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-04-02 01:03:36,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-04-02 01:03:36,751 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 14 treesize of output 16 [2023-04-02 01:03:36,758 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 14 treesize of output 16 [2023-04-02 01:03:36,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:36,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:37,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:37,061 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-04-02 01:03:37,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-04-02 01:03:37,102 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 14 treesize of output 16 [2023-04-02 01:03:37,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:37,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:37,451 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 14 treesize of output 16 [2023-04-02 01:03:37,455 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 14 treesize of output 16 [2023-04-02 01:03:37,482 INFO L321 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2023-04-02 01:03:37,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2023-04-02 01:03:37,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:37,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:37,588 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 14 treesize of output 16 [2023-04-02 01:03:37,598 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 14 treesize of output 16 [2023-04-02 01:03:37,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-04-02 01:03:37,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-04-02 01:03:37,779 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-04-02 01:03:37,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 39 [2023-04-02 01:03:37,800 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-04-02 01:03:37,801 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 14 treesize of output 20 [2023-04-02 01:03:37,809 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-04-02 01:03:37,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-02 01:03:38,053 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 56 treesize of output 48 [2023-04-02 01:03:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 229 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-02 01:03:38,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:03:38,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-02 01:03:38,318 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 17 treesize of output 21 [2023-04-02 01:03:38,329 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 27 treesize of output 21 [2023-04-02 01:03:42,714 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1181 (Array Int Int)) (v_subst_12 Int) (v_ArrVal_1177 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| c_main_~p~0.base v_ArrVal_1170) c_main_~t~0.base v_ArrVal_1177) v_subst_12 v_ArrVal_1181) c_main_~a~0.base) c_main_~a~0.offset) 6)) (= c_main_~a~0.offset 0)) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_subst_11 Int)) (or (< (select (select (store (store (store |c_#memory_int| c_main_~p~0.base v_ArrVal_1170) c_main_~t~0.base v_ArrVal_1177) v_subst_11 v_ArrVal_1181) c_main_~a~0.base) c_main_~a~0.offset) 6) (= v_subst_11 c_main_~a~0.base)))) is different from false [2023-04-02 01:03:52,230 WARN L223 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:04:01,702 WARN L223 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:04:16,541 WARN L223 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:04:33,620 WARN L223 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:04:54,290 WARN L223 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:05:17,591 WARN L223 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:05:46,178 WARN L223 SmtUtils]: Spent 7.79s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:06:10,221 WARN L223 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-02 01:06:45,774 WARN L223 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)