./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:26:39,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:26:39,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:26:39,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:26:39,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:26:39,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:26:39,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:26:39,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:26:39,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:26:39,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:26:39,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:26:39,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:26:39,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:26:39,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:26:39,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:26:39,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:26:39,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:26:39,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:26:39,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:26:39,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:26:39,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:26:39,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:26:39,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:26:39,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:26:39,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:26:39,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:26:39,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:26:39,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:26:39,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:26:39,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:26:39,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:26:39,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:26:39,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:26:39,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:26:39,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:26:39,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:26:39,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:26:39,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:26:39,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:26:39,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:26:39,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:26:39,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:26:39,498 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:26:39,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:26:39,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:26:39,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:26:39,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:26:39,499 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:26:39,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:26:39,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:26:39,500 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:26:39,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:26:39,500 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:26:39,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:26:39,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:26:39,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:26:39,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:26:39,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:26:39,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:26:39,502 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:26:39,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:26:39,502 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:26:39,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:26:39,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:26:39,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:26:39,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:26:39,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:26:39,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:26:39,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:26:39,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:26:39,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:26:39,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:26:39,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:26:39,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:26:39,504 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:26:39,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:26:39,505 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:26:39,505 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-02-15 19:26:39,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:26:39,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:26:39,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:26:39,685 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:26:39,687 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:26:39,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 19:26:40,643 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:26:40,894 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:26:40,895 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 19:26:40,909 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b43c1fb9/2d2b5c97c47d45729560fd796439e6eb/FLAGdb76b5553 [2023-02-15 19:26:40,918 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b43c1fb9/2d2b5c97c47d45729560fd796439e6eb [2023-02-15 19:26:40,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:26:40,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:26:40,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:26:40,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:26:40,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:26:40,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:26:40" (1/1) ... [2023-02-15 19:26:40,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca02572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:40, skipping insertion in model container [2023-02-15 19:26:40,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:26:40" (1/1) ... [2023-02-15 19:26:40,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:26:40,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:26:41,156 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-15 19:26:41,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:26:41,210 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:26:41,236 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-15 19:26:41,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:26:41,280 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:26:41,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41 WrapperNode [2023-02-15 19:26:41,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:26:41,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:26:41,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:26:41,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:26:41,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,332 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-15 19:26:41,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:26:41,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:26:41,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:26:41,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:26:41,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,378 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:26:41,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:26:41,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:26:41,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:26:41,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (1/1) ... [2023-02-15 19:26:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:26:41,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:26:41,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:26:41,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:26:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:26:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-15 19:26:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-15 19:26:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:26:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:26:41,481 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-15 19:26:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-15 19:26:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:26:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 19:26:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 19:26:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:26:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:26:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:26:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:26:41,482 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-15 19:26:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-15 19:26:41,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:26:41,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:26:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:26:41,580 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:26:41,582 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:26:41,911 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:26:41,915 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:26:41,923 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-15 19:26:41,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:26:41 BoogieIcfgContainer [2023-02-15 19:26:41,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:26:41,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:26:41,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:26:41,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:26:41,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:26:40" (1/3) ... [2023-02-15 19:26:41,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476e0866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:26:41, skipping insertion in model container [2023-02-15 19:26:41,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:26:41" (2/3) ... [2023-02-15 19:26:41,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476e0866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:26:41, skipping insertion in model container [2023-02-15 19:26:41,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:26:41" (3/3) ... [2023-02-15 19:26:41,932 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-02-15 19:26:41,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:26:41,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:26:41,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:26:41,994 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;@3d323f6d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:26:41,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:26:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-15 19:26:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 19:26:42,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:42,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:42,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2023-02-15 19:26:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:42,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826391865] [2023-02-15 19:26:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:42,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826391865] [2023-02-15 19:26:42,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826391865] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:42,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:42,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:26:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496713002] [2023-02-15 19:26:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:42,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:26:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:26:42,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:26:42,196 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:26:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:42,225 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2023-02-15 19:26:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:26:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 19:26:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:42,233 INFO L225 Difference]: With dead ends: 230 [2023-02-15 19:26:42,234 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 19:26:42,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:26:42,239 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:42,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:26:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 19:26:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-15 19:26:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:26:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2023-02-15 19:26:42,270 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2023-02-15 19:26:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:42,270 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2023-02-15 19:26:42,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:26:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2023-02-15 19:26:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 19:26:42,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:42,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:42,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:26:42,272 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2023-02-15 19:26:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:42,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647869288] [2023-02-15 19:26:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:42,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:42,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647869288] [2023-02-15 19:26:42,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647869288] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:42,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:42,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:26:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077716991] [2023-02-15 19:26:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:42,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:26:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:42,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:26:42,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:26:42,608 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:42,883 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2023-02-15 19:26:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:26:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 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 21 [2023-02-15 19:26:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:42,890 INFO L225 Difference]: With dead ends: 109 [2023-02-15 19:26:42,890 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 19:26:42,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:26:42,895 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:42,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:26:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 19:26:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 19:26:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 19:26:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2023-02-15 19:26:42,915 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2023-02-15 19:26:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:42,918 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2023-02-15 19:26:42,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2023-02-15 19:26:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:26:42,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:42,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:42,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:26:42,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2023-02-15 19:26:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:42,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877231550] [2023-02-15 19:26:42,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:43,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:43,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877231550] [2023-02-15 19:26:43,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877231550] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:43,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:43,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:26:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548288718] [2023-02-15 19:26:43,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:43,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:26:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:43,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:26:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:26:43,488 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:43,992 INFO L93 Difference]: Finished difference Result 196 states and 232 transitions. [2023-02-15 19:26:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 19:26:43,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 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 24 [2023-02-15 19:26:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:43,994 INFO L225 Difference]: With dead ends: 196 [2023-02-15 19:26:43,994 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 19:26:43,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:26:43,995 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 493 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:43,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 169 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:26:43,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 19:26:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2023-02-15 19:26:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 19:26:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2023-02-15 19:26:44,012 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2023-02-15 19:26:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:44,012 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2023-02-15 19:26:44,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2023-02-15 19:26:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:26:44,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:44,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:44,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:26:44,014 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2023-02-15 19:26:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:44,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483679460] [2023-02-15 19:26:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:44,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:44,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:44,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483679460] [2023-02-15 19:26:44,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483679460] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:44,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:44,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:26:44,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568218811] [2023-02-15 19:26:44,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:44,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:26:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:44,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:26:44,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:26:44,900 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:45,519 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2023-02-15 19:26:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:26:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 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 27 [2023-02-15 19:26:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:45,521 INFO L225 Difference]: With dead ends: 274 [2023-02-15 19:26:45,521 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 19:26:45,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:26:45,522 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 307 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:45,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 247 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:26:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 19:26:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2023-02-15 19:26:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:26:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2023-02-15 19:26:45,570 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2023-02-15 19:26:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:45,571 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2023-02-15 19:26:45,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2023-02-15 19:26:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 19:26:45,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:45,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:26:45,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2023-02-15 19:26:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:45,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615989783] [2023-02-15 19:26:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:45,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615989783] [2023-02-15 19:26:46,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615989783] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:46,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:46,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 19:26:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551807674] [2023-02-15 19:26:46,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:46,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:26:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:46,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:26:46,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:26:46,262 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:46,906 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2023-02-15 19:26:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 19:26:46,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 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 30 [2023-02-15 19:26:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:46,909 INFO L225 Difference]: With dead ends: 273 [2023-02-15 19:26:46,909 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 19:26:46,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2023-02-15 19:26:46,910 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 360 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:46,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 233 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 19:26:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 19:26:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2023-02-15 19:26:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:26:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2023-02-15 19:26:46,950 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2023-02-15 19:26:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:46,950 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2023-02-15 19:26:46,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2023-02-15 19:26:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 19:26:46,951 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:46,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:46,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:26:46,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2023-02-15 19:26:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:46,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985510243] [2023-02-15 19:26:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:48,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985510243] [2023-02-15 19:26:48,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985510243] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:48,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:48,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 19:26:48,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376794515] [2023-02-15 19:26:48,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:48,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:26:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:48,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:26:48,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:26:48,231 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:49,059 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2023-02-15 19:26:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:26:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 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 33 [2023-02-15 19:26:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:49,060 INFO L225 Difference]: With dead ends: 272 [2023-02-15 19:26:49,060 INFO L226 Difference]: Without dead ends: 269 [2023-02-15 19:26:49,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:26:49,061 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 341 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:49,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 277 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:26:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-02-15 19:26:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2023-02-15 19:26:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:26:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2023-02-15 19:26:49,080 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2023-02-15 19:26:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:49,080 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2023-02-15 19:26:49,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2023-02-15 19:26:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:26:49,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:49,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:49,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 19:26:49,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2023-02-15 19:26:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:49,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821742022] [2023-02-15 19:26:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:49,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:50,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821742022] [2023-02-15 19:26:50,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821742022] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:50,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:50,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 19:26:50,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304531756] [2023-02-15 19:26:50,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:50,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 19:26:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 19:26:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:26:50,531 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:51,660 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2023-02-15 19:26:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:26:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 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 36 [2023-02-15 19:26:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:51,662 INFO L225 Difference]: With dead ends: 271 [2023-02-15 19:26:51,662 INFO L226 Difference]: Without dead ends: 268 [2023-02-15 19:26:51,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:26:51,663 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 334 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:51,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 277 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 19:26:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-15 19:26:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2023-02-15 19:26:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:26:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2023-02-15 19:26:51,682 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2023-02-15 19:26:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:51,682 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2023-02-15 19:26:51,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2023-02-15 19:26:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 19:26:51,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:51,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:51,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 19:26:51,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2023-02-15 19:26:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003652734] [2023-02-15 19:26:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:52,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:52,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:52,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003652734] [2023-02-15 19:26:52,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003652734] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:26:52,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:26:52,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 19:26:52,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997425435] [2023-02-15 19:26:52,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:26:52,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:26:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:52,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:26:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:26:52,235 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:53,094 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2023-02-15 19:26:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 19:26:53,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 39 [2023-02-15 19:26:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:53,097 INFO L225 Difference]: With dead ends: 270 [2023-02-15 19:26:53,097 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 19:26:53,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-02-15 19:26:53,098 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 425 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:53,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 250 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:26:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 19:26:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2023-02-15 19:26:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:26:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2023-02-15 19:26:53,122 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2023-02-15 19:26:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:53,124 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2023-02-15 19:26:53,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:26:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2023-02-15 19:26:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 19:26:53,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:53,127 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:53,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:26:53,127 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2023-02-15 19:26:53,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:26:53,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130973] [2023-02-15 19:26:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:26:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:54,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:26:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:54,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:26:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:26:54,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:26:54,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130973] [2023-02-15 19:26:54,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:26:54,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572971801] [2023-02-15 19:26:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:26:54,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:26:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:26:54,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:26:54,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:26:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:26:54,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 130 conjunts are in the unsatisfiable core [2023-02-15 19:26:54,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:26:54,712 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:26:54,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:26:54,796 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:26:54,796 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 21 treesize of output 21 [2023-02-15 19:26:54,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:54,803 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-02-15 19:26:54,839 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 7 treesize of output 3 [2023-02-15 19:26:54,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:26:54,991 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-15 19:26:54,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 82 [2023-02-15 19:26:55,005 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 24 treesize of output 16 [2023-02-15 19:26:55,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 76 [2023-02-15 19:26:55,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:26:55,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:55,081 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 22 treesize of output 24 [2023-02-15 19:26:55,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 19:26:55,160 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:26:55,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:26:55,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-02-15 19:26:55,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2023-02-15 19:26:55,342 INFO L321 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2023-02-15 19:26:55,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 321 [2023-02-15 19:26:55,353 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-02-15 19:26:55,364 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-02-15 19:26:55,374 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-02-15 19:26:55,445 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:26:55,445 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:26:55,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:26:55,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:26:55,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 101 [2023-02-15 19:26:55,455 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-02-15 19:26:55,498 INFO L321 Elim1Store]: treesize reduction 64, result has 24.7 percent of original size [2023-02-15 19:26:55,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 163 [2023-02-15 19:26:55,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:26:55,537 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-02-15 19:26:55,616 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-15 19:26:55,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 20 [2023-02-15 19:26:55,620 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-02-15 19:26:56,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:56,023 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-15 19:26:56,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 412 treesize of output 414 [2023-02-15 19:26:56,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 335 [2023-02-15 19:26:56,043 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 12 treesize of output 11 [2023-02-15 19:26:56,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:26:56,269 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2023-02-15 19:26:56,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 221 [2023-02-15 19:26:56,281 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-02-15 19:26:56,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 19:26:56,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 19:26:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:26:56,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:26:56,731 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1054 Int) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (not (= |c_~#gl_list~0.base| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1053) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1050) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1048) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1046) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_1054))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1023) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4))))) is different from false [2023-02-15 19:26:56,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572971801] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:26:56,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:26:56,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2023-02-15 19:26:56,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032397179] [2023-02-15 19:26:56,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:26:56,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 19:26:56,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:26:56,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 19:26:56,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=918, Unknown=18, NotChecked=62, Total=1122 [2023-02-15 19:26:56,734 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 19 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:26:59,741 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] [2023-02-15 19:27:01,750 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] [2023-02-15 19:27:03,791 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] [2023-02-15 19:27:05,808 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] [2023-02-15 19:27:07,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:27:10,751 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] [2023-02-15 19:27:12,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:27:14,781 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] [2023-02-15 19:27:16,792 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] [2023-02-15 19:27:18,810 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] [2023-02-15 19:27:20,826 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] [2023-02-15 19:27:22,839 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] [2023-02-15 19:27:24,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:27:27,041 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] [2023-02-15 19:27:29,062 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] [2023-02-15 19:27:31,076 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] [2023-02-15 19:27:33,118 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] [2023-02-15 19:27:36,238 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] [2023-02-15 19:27:38,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:27:40,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:27:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:41,137 INFO L93 Difference]: Finished difference Result 448 states and 523 transitions. [2023-02-15 19:27:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 19:27:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 19 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2023-02-15 19:27:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:41,141 INFO L225 Difference]: With dead ends: 448 [2023-02-15 19:27:41,141 INFO L226 Difference]: Without dead ends: 442 [2023-02-15 19:27:41,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=557, Invalid=3186, Unknown=43, NotChecked=120, Total=3906 [2023-02-15 19:27:41,143 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1515 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 266 mSolverCounterUnsat, 104 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 104 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:41,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 502 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 2292 Invalid, 104 Unknown, 0 Unchecked, 43.1s Time] [2023-02-15 19:27:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-02-15 19:27:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 277. [2023-02-15 19:27:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 241 states have (on average 1.1950207468879668) internal successors, (288), 255 states have internal predecessors, (288), 28 states have call successors, (28), 10 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:27:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 327 transitions. [2023-02-15 19:27:41,175 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 327 transitions. Word has length 40 [2023-02-15 19:27:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:41,176 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 327 transitions. [2023-02-15 19:27:41,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 19 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:27:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 327 transitions. [2023-02-15 19:27:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:27:41,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:41,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:41,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:27:41,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:41,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2023-02-15 19:27:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327258399] [2023-02-15 19:27:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:41,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:42,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:27:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:42,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327258399] [2023-02-15 19:27:42,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327258399] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:42,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:42,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 19:27:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187339340] [2023-02-15 19:27:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:42,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 19:27:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:42,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 19:27:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:27:42,829 INFO L87 Difference]: Start difference. First operand 277 states and 327 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:27:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:44,482 INFO L93 Difference]: Finished difference Result 322 states and 378 transitions. [2023-02-15 19:27:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 19:27:44,483 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 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 42 [2023-02-15 19:27:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:44,484 INFO L225 Difference]: With dead ends: 322 [2023-02-15 19:27:44,485 INFO L226 Difference]: Without dead ends: 319 [2023-02-15 19:27:44,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2023-02-15 19:27:44,487 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 383 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:44,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 343 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 19:27:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-15 19:27:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 280. [2023-02-15 19:27:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 244 states have (on average 1.1885245901639345) internal successors, (290), 258 states have internal predecessors, (290), 28 states have call successors, (28), 10 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:27:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 329 transitions. [2023-02-15 19:27:44,541 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 329 transitions. Word has length 42 [2023-02-15 19:27:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:44,541 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 329 transitions. [2023-02-15 19:27:44,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:27:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 329 transitions. [2023-02-15 19:27:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 19:27:44,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:44,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:44,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 19:27:44,543 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2023-02-15 19:27:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:44,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541225735] [2023-02-15 19:27:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:27:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:45,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:27:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:27:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:45,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541225735] [2023-02-15 19:27:45,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541225735] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:45,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287928375] [2023-02-15 19:27:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:45,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:45,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:27:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:27:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:45,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 127 conjunts are in the unsatisfiable core [2023-02-15 19:27:45,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:45,809 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:27:45,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-15 19:27:45,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:27:45,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:45,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:27:45,992 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 19:27:45,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 80 [2023-02-15 19:27:46,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:46,027 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:27:46,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 95 [2023-02-15 19:27:46,079 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| 3) 1) (= |c_~#gl_list~0.base| 3) (not (= 0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| 3)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|)) (.cse0 (+ |c_~#gl_list~0.offset| 4))) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (and (= (select v_DerPreprocessor_21 .cse0) |c_~#gl_list~0.base|) (= .cse1 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_21) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_20) |c_~#gl_list~0.base| v_DerPreprocessor_21) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1471) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (exists ((|list_add___list_add_~next#1.offset| Int)) (= (select v_DerPreprocessor_21 (+ |list_add___list_add_~next#1.offset| 4)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_21 |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (and (= (select v_DerPreprocessor_21 |c_~#gl_list~0.offset|) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (select v_DerPreprocessor_21 .cse0) |c_~#gl_list~0.base|) (= .cse1 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_21) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_20) |c_~#gl_list~0.base| v_DerPreprocessor_21) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1471) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (and (= .cse1 (store (select (store (store (store (store |c_#memory_$Pointer$.base| |c_~#gl_list~0.base| v_DerPreprocessor_21) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_20) |c_~#gl_list~0.base| v_DerPreprocessor_21) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1471) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_21 .cse0) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (select v_DerPreprocessor_21 |c_~#gl_list~0.offset|) |c_~#gl_list~0.base|))))) (= |c_~#gl_list~0.offset| 0)) is different from true [2023-02-15 19:27:46,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:46,114 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 78 treesize of output 76 [2023-02-15 19:27:46,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:46,134 INFO L321 Elim1Store]: treesize reduction 22, result has 52.2 percent of original size [2023-02-15 19:27:46,134 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 94 [2023-02-15 19:27:46,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:46,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2023-02-15 19:27:46,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:46,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 69 [2023-02-15 19:27:46,213 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-02-15 19:27:46,219 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:27:46,223 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-02-15 19:27:46,231 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 54 treesize of output 44 [2023-02-15 19:27:46,370 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:46,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:27:46,429 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 68 treesize of output 58 [2023-02-15 19:27:46,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:46,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2023-02-15 19:27:46,548 INFO L321 Elim1Store]: treesize reduction 177, result has 36.1 percent of original size [2023-02-15 19:27:46,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 397 [2023-02-15 19:27:46,556 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-02-15 19:27:46,564 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-02-15 19:27:46,572 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-02-15 19:27:46,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:46,957 INFO L321 Elim1Store]: treesize reduction 127, result has 24.9 percent of original size [2023-02-15 19:27:46,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1083 treesize of output 951 [2023-02-15 19:27:47,021 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-02-15 19:27:47,042 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-02-15 19:27:47,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:47,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:47,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 85 [2023-02-15 19:27:47,160 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-02-15 19:27:47,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:47,561 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-15 19:27:47,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 304 treesize of output 316 [2023-02-15 19:27:47,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:47,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 241 [2023-02-15 19:27:47,576 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 12 treesize of output 11 [2023-02-15 19:27:47,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:47,612 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 19:27:47,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 32 [2023-02-15 19:27:47,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 19:27:47,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2023-02-15 19:27:47,666 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-02-15 19:27:47,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 19:27:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 19:27:47,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:48,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287928375] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:48,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:27:48,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2023-02-15 19:27:48,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706529453] [2023-02-15 19:27:48,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:48,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 19:27:48,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:48,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 19:27:48,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1065, Unknown=28, NotChecked=66, Total=1260 [2023-02-15 19:27:48,308 INFO L87 Difference]: Start difference. First operand 280 states and 329 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 21 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:27:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:57,339 INFO L93 Difference]: Finished difference Result 432 states and 504 transitions. [2023-02-15 19:27:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 19:27:57,339 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 21 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 43 [2023-02-15 19:27:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:57,341 INFO L225 Difference]: With dead ends: 432 [2023-02-15 19:27:57,341 INFO L226 Difference]: Without dead ends: 429 [2023-02-15 19:27:57,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=468, Invalid=3255, Unknown=63, NotChecked=120, Total=3906 [2023-02-15 19:27:57,343 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2184 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 384 mSolverCounterUnsat, 188 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2184 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 3522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 188 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:57,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2184 Valid, 470 Invalid, 3522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2617 Invalid, 188 Unknown, 333 Unchecked, 2.2s Time] [2023-02-15 19:27:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-02-15 19:27:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 280. [2023-02-15 19:27:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 244 states have (on average 1.1844262295081966) internal successors, (289), 258 states have internal predecessors, (289), 28 states have call successors, (28), 10 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:27:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 328 transitions. [2023-02-15 19:27:57,391 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 328 transitions. Word has length 43 [2023-02-15 19:27:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:57,391 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 328 transitions. [2023-02-15 19:27:57,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 21 states have internal predecessors, (73), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:27:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 328 transitions. [2023-02-15 19:27:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 19:27:57,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:57,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:57,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 19:27:57,597 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,SelfDestructingSolverStorable10 [2023-02-15 19:27:57,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2023-02-15 19:27:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:57,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034820613] [2023-02-15 19:27:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:57,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:27:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034820613] [2023-02-15 19:27:58,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034820613] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:58,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:58,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 19:27:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594482010] [2023-02-15 19:27:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:58,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 19:27:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 19:27:58,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-15 19:27:58,875 INFO L87 Difference]: Start difference. First operand 280 states and 328 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:28:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:28:00,027 INFO L93 Difference]: Finished difference Result 321 states and 374 transitions. [2023-02-15 19:28:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 19:28:00,027 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 45 [2023-02-15 19:28:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:28:00,029 INFO L225 Difference]: With dead ends: 321 [2023-02-15 19:28:00,029 INFO L226 Difference]: Without dead ends: 318 [2023-02-15 19:28:00,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-02-15 19:28:00,030 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 372 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:28:00,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 300 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 19:28:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-02-15 19:28:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2023-02-15 19:28:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 247 states have (on average 1.1781376518218623) internal successors, (291), 261 states have internal predecessors, (291), 28 states have call successors, (28), 10 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-15 19:28:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 330 transitions. [2023-02-15 19:28:00,090 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 330 transitions. Word has length 45 [2023-02-15 19:28:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:28:00,090 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 330 transitions. [2023-02-15 19:28:00,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:28:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 330 transitions. [2023-02-15 19:28:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 19:28:00,091 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:28:00,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:28:00,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 19:28:00,091 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:28:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:28:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash 438546823, now seen corresponding path program 1 times [2023-02-15 19:28:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:28:00,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515319295] [2023-02-15 19:28:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:28:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:28:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:01,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:28:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:28:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:28:02,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:28:02,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515319295] [2023-02-15 19:28:02,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515319295] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:28:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685106085] [2023-02-15 19:28:02,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:28:02,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:28:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:28:02,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:28:02,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:28:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:02,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 206 conjunts are in the unsatisfiable core [2023-02-15 19:28:02,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:28:02,704 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:28:02,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:28:02,766 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 23 treesize of output 23 [2023-02-15 19:28:02,772 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 23 treesize of output 23 [2023-02-15 19:28:02,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:02,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:28:02,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:02,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:28:03,026 INFO L321 Elim1Store]: treesize reduction 77, result has 3.8 percent of original size [2023-02-15 19:28:03,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 149 [2023-02-15 19:28:03,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:03,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:03,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:03,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 108 [2023-02-15 19:28:03,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:03,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 206 [2023-02-15 19:28:03,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:03,071 INFO L321 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-02-15 19:28:03,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 344 treesize of output 279 [2023-02-15 19:28:03,324 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-15 19:28:03,325 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 24123 treesize of output 23946 [2023-02-15 19:28:03,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:03,485 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:03,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:03,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:03,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:03,594 INFO L321 Elim1Store]: treesize reduction 132, result has 22.8 percent of original size [2023-02-15 19:28:03,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 33465 treesize of output 30608 [2023-02-15 19:28:03,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8502 treesize of output 7224 [2023-02-15 19:28:04,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:04,051 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 0 case distinctions, treesize of input 37906 treesize of output 37260 [2023-02-15 19:28:04,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:04,183 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 0 case distinctions, treesize of input 20670 treesize of output 18003 [2023-02-15 19:28:04,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2023-02-15 19:28:13,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:13,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2023-02-15 19:28:13,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:13,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 104 [2023-02-15 19:28:13,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:13,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:13,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 65 [2023-02-15 19:28:13,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 19:28:13,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-02-15 19:28:13,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:13,964 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 19:28:13,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:28:14,055 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 91 treesize of output 83 [2023-02-15 19:28:14,061 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:28:14,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 67 [2023-02-15 19:28:14,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 53 [2023-02-15 19:28:14,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,132 INFO L321 Elim1Store]: treesize reduction 99, result has 3.9 percent of original size [2023-02-15 19:28:14,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 37 [2023-02-15 19:28:14,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,324 INFO L321 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2023-02-15 19:28:14,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 234 treesize of output 188 [2023-02-15 19:28:14,346 INFO L321 Elim1Store]: treesize reduction 80, result has 5.9 percent of original size [2023-02-15 19:28:14,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 217 [2023-02-15 19:28:14,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 148 [2023-02-15 19:28:14,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,425 INFO L321 Elim1Store]: treesize reduction 282, result has 16.6 percent of original size [2023-02-15 19:28:14,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 177 treesize of output 139 [2023-02-15 19:28:14,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,445 INFO L321 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-02-15 19:28:14,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 99 [2023-02-15 19:28:14,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 101 [2023-02-15 19:28:14,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2023-02-15 19:28:14,461 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 12 treesize of output 11 [2023-02-15 19:28:14,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:14,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 55 treesize of output 31 [2023-02-15 19:28:14,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 19:28:14,549 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:28:14,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 96 [2023-02-15 19:28:14,555 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 19:28:14,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 64 [2023-02-15 19:28:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:15,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:15,139 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:28:15,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 46 [2023-02-15 19:28:15,152 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2023-02-15 19:28:15,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 57 treesize of output 32 [2023-02-15 19:28:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:28:15,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:28:15,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1983)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1982))) (let ((.cse1 (select (select .cse3 |c_~#gl_list~0.base|) .cse4)) (.cse2 (select (select .cse0 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse2)) (not (= .cse1 (select (select .cse3 .cse1) .cse2))) (= .cse2 |c_~#gl_list~0.offset|))))) (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1983)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1982))) (let ((.cse6 (select (select .cse8 |c_~#gl_list~0.base|) .cse4)) (.cse7 (select (select .cse5 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse5 .cse6) .cse7) .cse7)) (= .cse6 |c_~#gl_list~0.base|) (not (= .cse6 (select (select .cse8 .cse6) .cse7))))))))) is different from false [2023-02-15 19:28:16,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685106085] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:28:16,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:28:16,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2023-02-15 19:28:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324730387] [2023-02-15 19:28:16,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:28:16,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 19:28:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:28:16,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 19:28:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1577, Unknown=3, NotChecked=80, Total=1806 [2023-02-15 19:28:16,120 INFO L87 Difference]: Start difference. First operand 283 states and 330 transitions. Second operand has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:28:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:28:23,883 INFO L93 Difference]: Finished difference Result 418 states and 485 transitions. [2023-02-15 19:28:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 19:28:23,883 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2023-02-15 19:28:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:28:23,885 INFO L225 Difference]: With dead ends: 418 [2023-02-15 19:28:23,885 INFO L226 Difference]: Without dead ends: 415 [2023-02-15 19:28:23,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=438, Invalid=3592, Unknown=6, NotChecked=124, Total=4160 [2023-02-15 19:28:23,886 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1093 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 4249 mSolverCounterSat, 153 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 4454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 4249 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:28:23,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 967 Invalid, 4454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 4249 Invalid, 52 Unknown, 0 Unchecked, 4.2s Time] [2023-02-15 19:28:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-02-15 19:28:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 368. [2023-02-15 19:28:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 324 states have (on average 1.1820987654320987) internal successors, (383), 339 states have internal predecessors, (383), 33 states have call successors, (33), 13 states have call predecessors, (33), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:28:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 431 transitions. [2023-02-15 19:28:23,996 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 431 transitions. Word has length 46 [2023-02-15 19:28:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:28:23,996 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 431 transitions. [2023-02-15 19:28:23,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.323529411764706) internal successors, (79), 24 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:28:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 431 transitions. [2023-02-15 19:28:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 19:28:23,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:28:23,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:28:24,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 19:28:24,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:28:24,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:28:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:28:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2049301828, now seen corresponding path program 1 times [2023-02-15 19:28:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:28:24,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573412263] [2023-02-15 19:28:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:28:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:28:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:28:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:28:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:28:24,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573412263] [2023-02-15 19:28:24,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573412263] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:28:24,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:28:24,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:28:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813667229] [2023-02-15 19:28:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:28:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:28:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:28:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:28:24,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:28:24,288 INFO L87 Difference]: Start difference. First operand 368 states and 431 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:28:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:28:24,557 INFO L93 Difference]: Finished difference Result 370 states and 432 transitions. [2023-02-15 19:28:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:28:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 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 48 [2023-02-15 19:28:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:28:24,559 INFO L225 Difference]: With dead ends: 370 [2023-02-15 19:28:24,559 INFO L226 Difference]: Without dead ends: 367 [2023-02-15 19:28:24,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-02-15 19:28:24,561 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 106 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:28:24,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 174 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:28:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-02-15 19:28:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2023-02-15 19:28:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 324 states have (on average 1.1697530864197532) internal successors, (379), 338 states have internal predecessors, (379), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:28:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 426 transitions. [2023-02-15 19:28:24,624 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 426 transitions. Word has length 48 [2023-02-15 19:28:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:28:24,624 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 426 transitions. [2023-02-15 19:28:24,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:28:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 426 transitions. [2023-02-15 19:28:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 19:28:24,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:28:24,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:28:24,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 19:28:24,625 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:28:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:28:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash -764602366, now seen corresponding path program 1 times [2023-02-15 19:28:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:28:24,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012718135] [2023-02-15 19:28:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:28:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:28:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:28:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:26,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:28:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:28:26,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:28:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012718135] [2023-02-15 19:28:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012718135] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:28:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428947059] [2023-02-15 19:28:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:28:26,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:28:26,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:28:26,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:28:26,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:28:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:28:26,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 161 conjunts are in the unsatisfiable core [2023-02-15 19:28:26,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:28:26,885 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:28:26,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:28:26,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:28:26,952 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 23 treesize of output 23 [2023-02-15 19:28:26,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:26,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:28:26,971 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 9 treesize of output 3 [2023-02-15 19:28:27,169 INFO L321 Elim1Store]: treesize reduction 166, result has 5.1 percent of original size [2023-02-15 19:28:27,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 193 treesize of output 248 [2023-02-15 19:28:27,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,226 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:28:27,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 195 [2023-02-15 19:28:27,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-02-15 19:28:27,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,243 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 41 treesize of output 19 [2023-02-15 19:28:27,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,280 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-02-15 19:28:27,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 41 [2023-02-15 19:28:27,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-02-15 19:28:27,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 44 [2023-02-15 19:28:27,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-02-15 19:28:27,331 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:28:27,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,353 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 19:28:27,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 19:28:27,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:27,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,485 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:28:27,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 96 [2023-02-15 19:28:27,491 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 54 treesize of output 54 [2023-02-15 19:28:27,629 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 19:28:27,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:28:27,717 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:28:27,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 80 [2023-02-15 19:28:27,722 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 50 treesize of output 50 [2023-02-15 19:28:27,773 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 43 treesize of output 31 [2023-02-15 19:28:27,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,776 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:27,778 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:28:27,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 29 [2023-02-15 19:28:27,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:28:27,937 INFO L321 Elim1Store]: treesize reduction 86, result has 31.2 percent of original size [2023-02-15 19:28:27,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 166 treesize of output 132 [2023-02-15 19:28:27,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,951 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 19:28:27,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 125 [2023-02-15 19:28:27,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 106 [2023-02-15 19:28:27,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,960 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 57 treesize of output 54 [2023-02-15 19:28:27,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:28:27,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2023-02-15 19:28:28,198 INFO L321 Elim1Store]: treesize reduction 100, result has 36.3 percent of original size [2023-02-15 19:28:28,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 217 treesize of output 216 [2023-02-15 19:28:28,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 0 case distinctions, treesize of input 203 treesize of output 203 [2023-02-15 19:28:45,250 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 176 treesize of output 164 [2023-02-15 19:28:45,494 INFO L321 Elim1Store]: treesize reduction 65, result has 23.5 percent of original size [2023-02-15 19:28:45,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 177 treesize of output 85 [2023-02-15 19:28:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:28:45,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:28:45,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (or (= .cse0 |c_~#gl_list~0.base|) (not (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse2) 4)))))))) (forall ((v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse2))) (or (= .cse3 |c_~#gl_list~0.offset|) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse4 (select (select .cse5 |c_~#gl_list~0.base|) .cse2))) (= .cse4 (select (select .cse5 .cse4) (+ .cse3 4))))))))))) is different from false [2023-02-15 19:28:46,144 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5))) (and (forall ((v_ArrVal_2503 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_14| Int) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2504 Int) (v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2501) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2498) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2499) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2503) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2504)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse3))) (or (= .cse0 |c_~#gl_list~0.offset|) (not (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ |v_list_add___list_add_~next#1.offset_14| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2502) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2500) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2497))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse1 (select (select .cse2 |c_~#gl_list~0.base|) .cse3))) (= .cse1 (select (select .cse2 .cse1) (+ .cse0 4))))))))) (forall ((v_ArrVal_2503 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_14| Int) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2500 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2497 Int) (v_ArrVal_2498 (Array Int Int)) (v_ArrVal_2504 Int) (v_ArrVal_2472 (Array Int Int)) (v_ArrVal_2471 (Array Int Int))) (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 (+ |v_list_add___list_add_~next#1.offset_14| 4) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2502) |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2500) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2497))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2471))) (let ((.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse3))) (or (= .cse7 |c_~#gl_list~0.base|) (not (= .cse7 (select (select .cse8 .cse7) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2501) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2498) |c_~#gl_list~0.base| (store (select (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2499) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2503) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2504)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2472) |c_~#gl_list~0.base|) .cse3) 4))))))))))) is different from false [2023-02-15 19:28:46,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428947059] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:28:46,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:28:46,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2023-02-15 19:28:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34970380] [2023-02-15 19:28:46,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:28:46,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 19:28:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:28:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 19:28:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1433, Unknown=16, NotChecked=154, Total=1722 [2023-02-15 19:28:46,148 INFO L87 Difference]: Start difference. First operand 367 states and 426 transitions. Second operand has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:28:51,233 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] [2023-02-15 19:28:53,429 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] [2023-02-15 19:28:55,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:28:57,929 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] [2023-02-15 19:29:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:29:03,918 INFO L93 Difference]: Finished difference Result 414 states and 475 transitions. [2023-02-15 19:29:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 19:29:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2023-02-15 19:29:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:29:03,920 INFO L225 Difference]: With dead ends: 414 [2023-02-15 19:29:03,920 INFO L226 Difference]: Without dead ends: 411 [2023-02-15 19:29:03,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=363, Invalid=3282, Unknown=23, NotChecked=238, Total=3906 [2023-02-15 19:29:03,922 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1103 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 4352 mSolverCounterSat, 155 mSolverCounterUnsat, 135 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 4352 IncrementalHoareTripleChecker+Invalid, 135 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:29:03,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 934 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 4352 Invalid, 135 Unknown, 0 Unchecked, 12.6s Time] [2023-02-15 19:29:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-02-15 19:29:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 367. [2023-02-15 19:29:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 324 states have (on average 1.1666666666666667) internal successors, (378), 338 states have internal predecessors, (378), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:29:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 425 transitions. [2023-02-15 19:29:04,041 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 425 transitions. Word has length 49 [2023-02-15 19:29:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:29:04,042 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 425 transitions. [2023-02-15 19:29:04,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5757575757575757) internal successors, (85), 23 states have internal predecessors, (85), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:29:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 425 transitions. [2023-02-15 19:29:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 19:29:04,047 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:29:04,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:29:04,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 19:29:04,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 19:29:04,253 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:29:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:29:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2059695343, now seen corresponding path program 1 times [2023-02-15 19:29:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:29:04,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228757290] [2023-02-15 19:29:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:29:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:29:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:29:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:29:04,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228757290] [2023-02-15 19:29:04,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228757290] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:29:04,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:29:04,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:29:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340786065] [2023-02-15 19:29:04,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:29:04,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 19:29:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:29:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 19:29:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:29:04,407 INFO L87 Difference]: Start difference. First operand 367 states and 425 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:29:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:29:04,928 INFO L93 Difference]: Finished difference Result 369 states and 426 transitions. [2023-02-15 19:29:04,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:29:04,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 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 51 [2023-02-15 19:29:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:29:04,929 INFO L225 Difference]: With dead ends: 369 [2023-02-15 19:29:04,929 INFO L226 Difference]: Without dead ends: 366 [2023-02-15 19:29:04,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:29:04,930 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 163 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:29:04,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 306 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:29:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-02-15 19:29:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2023-02-15 19:29:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 324 states have (on average 1.154320987654321) internal successors, (374), 337 states have internal predecessors, (374), 31 states have call successors, (31), 13 states have call predecessors, (31), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:29:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 420 transitions. [2023-02-15 19:29:04,999 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 420 transitions. Word has length 51 [2023-02-15 19:29:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:29:04,999 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 420 transitions. [2023-02-15 19:29:04,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:29:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 420 transitions. [2023-02-15 19:29:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 19:29:05,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:29:05,000 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:29:05,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 19:29:05,000 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:29:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:29:05,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2029277591, now seen corresponding path program 1 times [2023-02-15 19:29:05,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:29:05,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421191356] [2023-02-15 19:29:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:05,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:29:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:05,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:29:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:29:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:29:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:29:06,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421191356] [2023-02-15 19:29:06,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421191356] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:06,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925544591] [2023-02-15 19:29:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:06,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:06,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:29:06,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:29:06,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:29:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:06,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-15 19:29:06,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:29:06,501 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:29:06,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-15 19:29:06,557 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:29:06,557 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 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-15 19:29:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:06,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:06,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2023-02-15 19:29:06,633 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 19:29:06,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 85 [2023-02-15 19:29:06,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:06,651 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:29:06,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 98 [2023-02-15 19:29:06,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:06,761 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 50 treesize of output 50 [2023-02-15 19:29:06,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:06,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2023-02-15 19:29:06,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:06,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2023-02-15 19:29:06,780 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-02-15 19:29:06,789 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 22 treesize of output 16 [2023-02-15 19:29:06,877 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:29:06,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:29:06,934 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 64 treesize of output 54 [2023-02-15 19:29:06,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:06,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2023-02-15 19:29:07,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:07,059 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 19:29:07,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 71 [2023-02-15 19:29:07,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:07,075 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-15 19:29:07,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 78 [2023-02-15 19:29:07,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:07,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2023-02-15 19:29:07,081 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-02-15 19:29:07,184 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-02-15 19:29:07,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 116 [2023-02-15 19:29:07,222 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:29:07,330 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:29:07,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 19:29:07,448 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 7 treesize of output 3 [2023-02-15 19:29:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:29:07,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:29:07,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2023-02-15 19:29:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925544591] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:07,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:29:07,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2023-02-15 19:29:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856638098] [2023-02-15 19:29:07,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:29:07,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 19:29:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:29:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 19:29:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1091, Unknown=21, NotChecked=0, Total=1260 [2023-02-15 19:29:07,817 INFO L87 Difference]: Start difference. First operand 366 states and 420 transitions. Second operand has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 18 states have internal predecessors, (74), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:29:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:29:10,146 INFO L93 Difference]: Finished difference Result 410 states and 465 transitions. [2023-02-15 19:29:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 19:29:10,147 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 18 states have internal predecessors, (74), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 52 [2023-02-15 19:29:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:29:10,148 INFO L225 Difference]: With dead ends: 410 [2023-02-15 19:29:10,148 INFO L226 Difference]: Without dead ends: 407 [2023-02-15 19:29:10,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=407, Invalid=2423, Unknown=32, NotChecked=0, Total=2862 [2023-02-15 19:29:10,149 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1054 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 118 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:29:10,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 403 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1674 Invalid, 56 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 19:29:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-02-15 19:29:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2023-02-15 19:29:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 324 states have (on average 1.1512345679012346) internal successors, (373), 337 states have internal predecessors, (373), 31 states have call successors, (31), 13 states have call predecessors, (31), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:29:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 419 transitions. [2023-02-15 19:29:10,238 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 419 transitions. Word has length 52 [2023-02-15 19:29:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:29:10,238 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 419 transitions. [2023-02-15 19:29:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.642857142857143) internal successors, (74), 18 states have internal predecessors, (74), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:29:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 419 transitions. [2023-02-15 19:29:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 19:29:10,240 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:29:10,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:29:10,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:29:10,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 19:29:10,446 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:29:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:29:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash -617053959, now seen corresponding path program 1 times [2023-02-15 19:29:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:29:10,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008292843] [2023-02-15 19:29:10,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:29:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:29:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:29:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:29:10,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008292843] [2023-02-15 19:29:10,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008292843] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:29:10,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:29:10,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:29:10,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819701420] [2023-02-15 19:29:10,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:29:10,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:29:10,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:29:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:29:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:29:10,493 INFO L87 Difference]: Start difference. First operand 366 states and 419 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:29:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:29:10,663 INFO L93 Difference]: Finished difference Result 368 states and 420 transitions. [2023-02-15 19:29:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:29:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 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 53 [2023-02-15 19:29:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:29:10,665 INFO L225 Difference]: With dead ends: 368 [2023-02-15 19:29:10,665 INFO L226 Difference]: Without dead ends: 365 [2023-02-15 19:29:10,666 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-02-15 19:29:10,667 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:29:10,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 108 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:29:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-02-15 19:29:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2023-02-15 19:29:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 324 states have (on average 1.1388888888888888) internal successors, (369), 336 states have internal predecessors, (369), 30 states have call successors, (30), 13 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:29:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 414 transitions. [2023-02-15 19:29:10,752 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 414 transitions. Word has length 53 [2023-02-15 19:29:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:29:10,752 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 414 transitions. [2023-02-15 19:29:10,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:29:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 414 transitions. [2023-02-15 19:29:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 19:29:10,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:29:10,753 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:29:10,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 19:29:10,753 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:29:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:29:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1943731347, now seen corresponding path program 1 times [2023-02-15 19:29:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:29:10,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558005032] [2023-02-15 19:29:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:29:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:12,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:29:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:12,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:29:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:29:12,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:29:12,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558005032] [2023-02-15 19:29:12,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558005032] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:12,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409982215] [2023-02-15 19:29:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:12,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:12,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:29:12,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:29:12,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 19:29:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:13,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 195 conjunts are in the unsatisfiable core [2023-02-15 19:29:13,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:29:13,157 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:29:13,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:29:13,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:29:13,235 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 23 treesize of output 23 [2023-02-15 19:29:13,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:29:13,257 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 9 treesize of output 3 [2023-02-15 19:29:13,434 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 19:29:13,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 120 [2023-02-15 19:29:13,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,461 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:29:13,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 100 [2023-02-15 19:29:13,475 INFO L321 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-02-15 19:29:13,475 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 51 treesize of output 45 [2023-02-15 19:29:13,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,481 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 39 treesize of output 34 [2023-02-15 19:29:13,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,485 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 64 treesize of output 38 [2023-02-15 19:29:13,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,503 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 19:29:13,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 19:29:13,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,518 INFO L321 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-02-15 19:29:13,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 44 [2023-02-15 19:29:13,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2023-02-15 19:29:13,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 73 [2023-02-15 19:29:13,781 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 19:29:13,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:29:13,860 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:29:13,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 86 [2023-02-15 19:29:13,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2023-02-15 19:29:13,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:13,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 45 [2023-02-15 19:29:13,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:13,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-02-15 19:29:14,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,073 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 19:29:14,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 135 [2023-02-15 19:29:14,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,113 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 19:29:14,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 141 [2023-02-15 19:29:14,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 112 [2023-02-15 19:29:14,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2023-02-15 19:29:14,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2023-02-15 19:29:14,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:14,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-02-15 19:29:14,307 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 19:29:14,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 165 treesize of output 158 [2023-02-15 19:29:14,325 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-15 19:29:14,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 161 [2023-02-15 19:29:15,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:15,632 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-02-15 19:29:15,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 21 [2023-02-15 19:29:15,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:15,648 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-15 19:29:15,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 43 [2023-02-15 19:29:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:29:15,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:29:15,975 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3415 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414) |c_~#gl_list~0.base|) .cse3))) (or (= .cse0 |c_~#gl_list~0.base|) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415))) (let ((.cse2 (+ (select (select .cse1 |c_~#gl_list~0.base|) .cse3) 8))) (= (select (select .cse1 .cse0) .cse2) .cse2)))))) (forall ((v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3415 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415))) (let ((.cse6 (select (select .cse4 |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse5 (+ .cse6 8))) (= (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414) |c_~#gl_list~0.base|) .cse3)) .cse5) .cse5)) (= .cse6 |c_~#gl_list~0.offset|))))) (forall ((v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3415 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414))) (let ((.cse8 (select (select .cse7 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse7 .cse8) (+ .cse9 8)) .cse8))) (= .cse9 |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3415 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414))) (let ((.cse10 (select (select .cse11 |c_~#gl_list~0.base|) .cse3))) (or (= .cse10 |c_~#gl_list~0.base|) (= (select (select .cse11 .cse10) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415) |c_~#gl_list~0.base|) .cse3) 8)) .cse10))))))) is different from false [2023-02-15 19:29:16,265 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4)) (.cse10 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse11 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse7 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_20|) (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse6 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse2 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse6 .cse11)))) (store (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse9 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415))) (let ((.cse1 (select (select .cse2 |c_~#gl_list~0.base|) .cse7))) (or (= .cse1 |c_~#gl_list~0.offset|) (let ((.cse8 (+ .cse1 8))) (= (select (select .cse2 (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414) |c_~#gl_list~0.base|) .cse7)) .cse8) .cse8))))))))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse15 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse12 (store (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414))) (let ((.cse13 (select (select .cse12 |c_~#gl_list~0.base|) .cse7))) (or (= (select (select .cse12 .cse13) (+ (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse15 .cse11)))) (store (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415) |c_~#gl_list~0.base|) .cse7) 8)) .cse13) (= .cse13 |c_~#gl_list~0.base|)))))) (< .cse0 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse21 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse18 (select (select (store (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414) |c_~#gl_list~0.base|) .cse7))) (or (let ((.cse17 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse21 .cse11)))) (store (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415))) (let ((.cse19 (+ (select (select .cse17 |c_~#gl_list~0.base|) .cse7) 8))) (= (select (select .cse17 .cse18) .cse19) .cse19))) (= .cse18 |c_~#gl_list~0.base|))))) (< .cse0 |v_list_add___list_add_~next#1.offset_20|))) (forall ((|v_list_add___list_add_~next#1.offset_20| Int)) (or (< .cse0 |v_list_add___list_add_~next#1.offset_20|) (forall ((v_ArrVal_3446 Int) (v_ArrVal_3445 (Array Int Int)) (v_ArrVal_3444 Int) (v_ArrVal_3447 (Array Int Int)) (v_ArrVal_3414 (Array Int Int)) (v_ArrVal_3448 (Array Int Int)) (v_ArrVal_3415 (Array Int Int)) (v_ArrVal_3449 (Array Int Int))) (let ((.cse27 (+ |v_list_add___list_add_~next#1.offset_20| 4))) (let ((.cse25 (select (select (store (let ((.cse28 (store |c_#memory_$Pointer$.offset| .cse4 (store .cse10 .cse27 .cse11)))) (store (store .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3447) |c_~#gl_list~0.base| (store (select (store .cse28 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3445) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3446))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3415) |c_~#gl_list~0.base|) .cse7))) (or (let ((.cse23 (store (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3449) |c_~#gl_list~0.base| (store (select (store .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3448) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_3444))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3414))) (let ((.cse24 (select (select .cse23 |c_~#gl_list~0.base|) .cse7))) (= (select (select .cse23 .cse24) (+ .cse25 8)) .cse24))) (= .cse25 |c_~#gl_list~0.offset|)))))))))) is different from false [2023-02-15 19:29:16,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409982215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:16,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:29:16,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-15 19:29:16,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695603085] [2023-02-15 19:29:16,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:29:16,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 19:29:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:29:16,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 19:29:16,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=8, NotChecked=150, Total=1640 [2023-02-15 19:29:16,273 INFO L87 Difference]: Start difference. First operand 365 states and 414 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:29:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:29:23,758 INFO L93 Difference]: Finished difference Result 406 states and 455 transitions. [2023-02-15 19:29:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 19:29:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2023-02-15 19:29:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:29:23,759 INFO L225 Difference]: With dead ends: 406 [2023-02-15 19:29:23,759 INFO L226 Difference]: Without dead ends: 402 [2023-02-15 19:29:23,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=448, Invalid=3706, Unknown=14, NotChecked=254, Total=4422 [2023-02-15 19:29:23,761 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1040 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 4364 mSolverCounterSat, 105 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 4495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 4364 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:29:23,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1015 Invalid, 4495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 4364 Invalid, 26 Unknown, 0 Unchecked, 4.5s Time] [2023-02-15 19:29:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-02-15 19:29:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 365. [2023-02-15 19:29:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 324 states have (on average 1.132716049382716) internal successors, (367), 336 states have internal predecessors, (367), 30 states have call successors, (30), 13 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:29:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 412 transitions. [2023-02-15 19:29:23,833 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 412 transitions. Word has length 55 [2023-02-15 19:29:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:29:23,833 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 412 transitions. [2023-02-15 19:29:23,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 25 states have internal predecessors, (97), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:29:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 412 transitions. [2023-02-15 19:29:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 19:29:23,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:29:23,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:29:23,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 19:29:24,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:24,039 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:29:24,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:29:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1129884476, now seen corresponding path program 1 times [2023-02-15 19:29:24,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:29:24,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430506364] [2023-02-15 19:29:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:24,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:29:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:29:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:26,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:29:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:29:26,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:29:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430506364] [2023-02-15 19:29:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430506364] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159190356] [2023-02-15 19:29:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:26,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:26,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:29:26,367 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:29:26,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 19:29:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:26,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 197 conjunts are in the unsatisfiable core [2023-02-15 19:29:26,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:29:26,712 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:29:26,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:29:26,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 19:29:26,774 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 23 treesize of output 23 [2023-02-15 19:29:26,790 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 9 treesize of output 3 [2023-02-15 19:29:26,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:26,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:29:26,960 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 19:29:26,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 109 [2023-02-15 19:29:26,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:26,985 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:29:26,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 91 [2023-02-15 19:29:26,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 56 [2023-02-15 19:29:27,007 INFO L321 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-02-15 19:29:27,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2023-02-15 19:29:27,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,012 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 64 treesize of output 38 [2023-02-15 19:29:27,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,032 INFO L321 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-02-15 19:29:27,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2023-02-15 19:29:27,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,217 INFO L321 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-02-15 19:29:27,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 149 [2023-02-15 19:29:27,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2023-02-15 19:29:27,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-15 19:29:27,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,245 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 19:29:27,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2023-02-15 19:29:27,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2023-02-15 19:29:27,427 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 19:29:27,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:29:27,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2023-02-15 19:29:27,532 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:29:27,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 100 [2023-02-15 19:29:27,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:27,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 59 [2023-02-15 19:29:27,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-02-15 19:29:27,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,807 INFO L321 Elim1Store]: treesize reduction 70, result has 25.5 percent of original size [2023-02-15 19:29:27,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 206 treesize of output 149 [2023-02-15 19:29:27,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,822 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 19:29:27,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 155 [2023-02-15 19:29:27,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,842 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:29:27,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 137 [2023-02-15 19:29:27,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 89 [2023-02-15 19:29:27,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2023-02-15 19:29:27,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:27,866 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:29:27,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 64 [2023-02-15 19:29:28,034 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2023-02-15 19:29:28,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 165 treesize of output 158 [2023-02-15 19:29:28,058 INFO L321 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2023-02-15 19:29:28,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 161 [2023-02-15 19:29:29,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:29,547 INFO L321 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-02-15 19:29:29,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 21 [2023-02-15 19:29:29,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:29,564 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-15 19:29:29,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 43 [2023-02-15 19:29:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:29:29,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:29:30,035 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse2))) (or (= .cse0 |c_~#gl_list~0.base|) (= (select (select .cse1 .cse0) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815) |c_~#gl_list~0.base|) .cse2) 12)) .cse0))))) (forall ((v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815))) (let ((.cse4 (select (select .cse3 |c_~#gl_list~0.base|) .cse2))) (or (= (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814) |c_~#gl_list~0.base|) .cse2)) (+ .cse4 12)) (+ .cse4 8)) (= .cse4 |c_~#gl_list~0.offset|))))) (forall ((v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815) |c_~#gl_list~0.base|) .cse2))) (or (= .cse5 |c_~#gl_list~0.offset|) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814))) (let ((.cse7 (select (select .cse6 |c_~#gl_list~0.base|) .cse2))) (= (select (select .cse6 .cse7) (+ .cse5 12)) .cse7)))))) (forall ((v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814) |c_~#gl_list~0.base|) .cse2))) (or (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815))) (let ((.cse10 (select (select .cse8 |c_~#gl_list~0.base|) .cse2))) (= (select (select .cse8 .cse9) (+ .cse10 12)) (+ .cse10 8)))) (= .cse9 |c_~#gl_list~0.base|)))))) is different from false [2023-02-15 19:29:30,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse10 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4)) (.cse3 (+ |c_~#gl_list~0.offset| 4)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (and (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse7 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse2 (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse7 .cse10)))) (store (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse8 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815) |c_~#gl_list~0.base|) .cse3))) (or (let ((.cse0 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse4 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse0 .cse1) (+ .cse2 12)) .cse1))) (= .cse2 |c_~#gl_list~0.offset|))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|))) (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|))) (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse15 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse13 (store (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse15 .cse10)))) (store (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse16 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815))) (let ((.cse12 (select (select .cse13 |c_~#gl_list~0.base|) .cse3))) (or (= .cse12 |c_~#gl_list~0.offset|) (= (select (select .cse13 (select (select (store (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse15 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse14 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814) |c_~#gl_list~0.base|) .cse3)) (+ .cse12 12)) (+ .cse12 8))))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|))))) (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse21 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse17 (select (select (store (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse21 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse22 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814) |c_~#gl_list~0.base|) .cse3))) (or (= .cse17 |c_~#gl_list~0.base|) (let ((.cse18 (store (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse21 .cse10)))) (store (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse20 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815))) (let ((.cse19 (select (select .cse18 |c_~#gl_list~0.base|) .cse3))) (= (select (select .cse18 .cse17) (+ .cse19 12)) (+ .cse19 8)))))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|))) (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|))) (forall ((|v_list_add___list_add_~prev#1.offset_23| Int)) (or (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_23|) (forall ((|v_list_add___list_add_~next#1.offset_23| Int)) (or (forall ((v_ArrVal_3845 Int) (v_ArrVal_3843 Int) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3814 (Array Int Int)) (v_ArrVal_3848 (Array Int Int)) (v_ArrVal_3815 (Array Int Int))) (let ((.cse26 (+ |v_list_add___list_add_~next#1.offset_23| 4))) (let ((.cse23 (store (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse26 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3848) |c_~#gl_list~0.base| (store (select (store .cse27 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3846) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3843))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3814))) (let ((.cse24 (select (select .cse23 |c_~#gl_list~0.base|) .cse3))) (or (= (select (select .cse23 .cse24) (+ (select (select (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| .cse5 (store .cse9 .cse26 .cse10)))) (store (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3847) |c_~#gl_list~0.base| (store (select (store .cse25 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3844) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_23| v_ArrVal_3845))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_3815) |c_~#gl_list~0.base|) .cse3) 12)) .cse24) (= .cse24 |c_~#gl_list~0.base|)))))) (< .cse11 |v_list_add___list_add_~next#1.offset_23|)))))))) is different from false [2023-02-15 19:29:30,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159190356] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:30,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:29:30,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2023-02-15 19:29:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170620236] [2023-02-15 19:29:30,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:29:30,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 19:29:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:29:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 19:29:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=8, NotChecked=154, Total=1722 [2023-02-15 19:29:30,479 INFO L87 Difference]: Start difference. First operand 365 states and 412 transitions. Second operand has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:29:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:29:38,009 INFO L93 Difference]: Finished difference Result 404 states and 451 transitions. [2023-02-15 19:29:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 19:29:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2023-02-15 19:29:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:29:38,010 INFO L225 Difference]: With dead ends: 404 [2023-02-15 19:29:38,010 INFO L226 Difference]: Without dead ends: 401 [2023-02-15 19:29:38,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=468, Invalid=3945, Unknown=17, NotChecked=262, Total=4692 [2023-02-15 19:29:38,012 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 991 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 4143 mSolverCounterSat, 103 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4143 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:29:38,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1028 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4143 Invalid, 27 Unknown, 0 Unchecked, 4.1s Time] [2023-02-15 19:29:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-02-15 19:29:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 365. [2023-02-15 19:29:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 324 states have (on average 1.1296296296296295) internal successors, (366), 336 states have internal predecessors, (366), 30 states have call successors, (30), 13 states have call predecessors, (30), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 19:29:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 411 transitions. [2023-02-15 19:29:38,090 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 411 transitions. Word has length 58 [2023-02-15 19:29:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:29:38,090 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 411 transitions. [2023-02-15 19:29:38,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.942857142857143) internal successors, (103), 25 states have internal predecessors, (103), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 19:29:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 411 transitions. [2023-02-15 19:29:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 19:29:38,091 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:29:38,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:29:38,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 19:29:38,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:38,296 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:29:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:29:38,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1691144517, now seen corresponding path program 2 times [2023-02-15 19:29:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:29:38,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067621732] [2023-02-15 19:29:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:29:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:29:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:29:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:42,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:29:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:42,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:29:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:29:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:29:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:29:43,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067621732] [2023-02-15 19:29:43,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067621732] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:43,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247232710] [2023-02-15 19:29:43,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:29:43,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:29:43,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:29:43,012 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:29:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 19:29:43,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:29:43,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:29:43,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 273 conjunts are in the unsatisfiable core [2023-02-15 19:29:43,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:29:43,548 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:29:43,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:29:43,622 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 23 treesize of output 23 [2023-02-15 19:29:43,627 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 23 treesize of output 23 [2023-02-15 19:29:43,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:29:43,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:29:43,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,856 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:29:43,859 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 19:29:43,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 102 [2023-02-15 19:29:43,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 91 [2023-02-15 19:29:43,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2023-02-15 19:29:43,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,910 INFO L321 Elim1Store]: treesize reduction 50, result has 15.3 percent of original size [2023-02-15 19:29:43,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 52 [2023-02-15 19:29:43,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-02-15 19:29:43,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,919 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 31 treesize of output 26 [2023-02-15 19:29:43,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:43,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 19:29:44,005 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:29:44,006 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 98 treesize of output 91 [2023-02-15 19:29:44,030 INFO L321 Elim1Store]: treesize reduction 186, result has 16.2 percent of original size [2023-02-15 19:29:44,031 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 68 [2023-02-15 19:29:44,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,142 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 19:29:44,142 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 28 treesize of output 45 [2023-02-15 19:29:44,229 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 19:29:44,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2023-02-15 19:29:44,232 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 54 treesize of output 48 [2023-02-15 19:29:44,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2023-02-15 19:29:44,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:29:44,295 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:29:44,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2023-02-15 19:29:44,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,498 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 19:29:44,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 95 [2023-02-15 19:29:44,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,515 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2023-02-15 19:29:44,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 98 [2023-02-15 19:29:44,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2023-02-15 19:29:44,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,537 INFO L321 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2023-02-15 19:29:44,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 80 [2023-02-15 19:29:44,555 INFO L321 Elim1Store]: treesize reduction 85, result has 20.6 percent of original size [2023-02-15 19:29:44,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 114 [2023-02-15 19:29:44,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2023-02-15 19:29:44,569 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-02-15 19:29:44,583 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:29:44,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-15 19:29:44,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 70 treesize of output 38 [2023-02-15 19:29:44,602 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-02-15 19:29:44,737 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:29:44,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 115 [2023-02-15 19:29:44,746 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 19:29:44,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 94 [2023-02-15 19:29:44,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:44,966 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 19:29:44,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:29:45,088 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 19:29:45,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 90 [2023-02-15 19:29:45,100 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:29:45,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 101 [2023-02-15 19:29:45,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:29:45,198 INFO L321 Elim1Store]: treesize reduction 30, result has 30.2 percent of original size [2023-02-15 19:29:45,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 56 [2023-02-15 19:29:45,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:29:45,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2023-02-15 19:29:45,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,441 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:29:45,457 INFO L321 Elim1Store]: treesize reduction 77, result has 10.5 percent of original size [2023-02-15 19:29:45,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 158 [2023-02-15 19:29:45,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,490 INFO L321 Elim1Store]: treesize reduction 86, result has 14.9 percent of original size [2023-02-15 19:29:45,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 205 treesize of output 182 [2023-02-15 19:29:45,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,508 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:29:45,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 136 [2023-02-15 19:29:45,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:29:45,518 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2023-02-15 19:29:45,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 145 treesize of output 127 [2023-02-15 19:29:45,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,548 INFO L321 Elim1Store]: treesize reduction 59, result has 26.3 percent of original size [2023-02-15 19:29:45,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 112 [2023-02-15 19:29:45,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:29:45,563 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:29:45,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 48 [2023-02-15 19:29:45,882 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-02-15 19:29:45,922 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-02-15 19:29:45,961 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-02-15 19:29:46,262 INFO L321 Elim1Store]: treesize reduction 74, result has 30.2 percent of original size [2023-02-15 19:29:46,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 276 treesize of output 222 [2023-02-15 19:29:46,298 INFO L321 Elim1Store]: treesize reduction 166, result has 35.9 percent of original size [2023-02-15 19:29:46,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 249 treesize of output 280 [2023-02-15 19:29:47,034 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 36 treesize of output 30 [2023-02-15 19:29:47,107 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 36 treesize of output 30 [2023-02-15 19:29:48,076 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:29:48,106 INFO L321 Elim1Store]: treesize reduction 69, result has 31.7 percent of original size [2023-02-15 19:29:48,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 86 [2023-02-15 19:29:48,120 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2023-02-15 19:29:48,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 54 [2023-02-15 19:29:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:29:48,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:29:48,714 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#gl_list~0.offset| 4))) (and (forall ((v_ArrVal_4391 (Array Int Int)) (v_ArrVal_4392 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4391)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4392))) (let ((.cse2 (select (select .cse3 |c_~#gl_list~0.base|) .cse4)) (.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (not (= .cse2 (select (select .cse3 .cse1) .cse2))) (= .cse1 |c_~#gl_list~0.base|))))) (forall ((v_ArrVal_4391 (Array Int Int)) (v_ArrVal_4392 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4392)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4391))) (let ((.cse6 (select (select .cse5 |c_~#gl_list~0.base|) .cse4)) (.cse7 (select (select .cse8 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse5 .cse6) .cse7) .cse6)) (not (= .cse7 (select (select .cse8 .cse6) .cse7))) (= .cse7 |c_~#gl_list~0.offset|))))))) is different from false [2023-02-15 19:29:49,074 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse12 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) 4))) (let ((.cse4 (+ |c_~#gl_list~0.offset| 4)) (.cse5 (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) .cse12 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) .cse12 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4))))) (and (forall ((|v_list_add___list_add_~prev#1.offset_26| Int)) (or (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_26|) (forall ((v_ArrVal_4419 Int) (v_ArrVal_4421 (Array Int Int)) (v_ArrVal_4422 (Array Int Int)) (v_ArrVal_4423 (Array Int Int)) (v_ArrVal_4424 (Array Int Int)) (v_ArrVal_4420 Int) (v_ArrVal_4391 (Array Int Int)) (v_ArrVal_4392 (Array Int Int))) (let ((.cse3 (store (store (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4424) |c_~#gl_list~0.base| (store (select (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4421) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_26| v_ArrVal_4419)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4392)) (.cse0 (store (store (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4423) |c_~#gl_list~0.base| (store (select (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4422) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_26| v_ArrVal_4420)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4391))) (let ((.cse1 (select (select .cse0 |c_~#gl_list~0.base|) .cse4)) (.cse2 (select (select .cse3 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (= .cse1 |c_~#gl_list~0.base|) (not (= .cse2 (select (select .cse3 .cse1) .cse2))))))))) (forall ((|v_list_add___list_add_~prev#1.offset_26| Int)) (or (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_26|) (forall ((v_ArrVal_4419 Int) (v_ArrVal_4421 (Array Int Int)) (v_ArrVal_4422 (Array Int Int)) (v_ArrVal_4423 (Array Int Int)) (v_ArrVal_4424 (Array Int Int)) (v_ArrVal_4420 Int) (v_ArrVal_4391 (Array Int Int)) (v_ArrVal_4392 (Array Int Int))) (let ((.cse10 (store (store (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4424) |c_~#gl_list~0.base| (store (select (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4421) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_26| v_ArrVal_4419)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4392)) (.cse7 (store (store (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4423) |c_~#gl_list~0.base| (store (select (store .cse5 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4422) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_26| v_ArrVal_4420)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_4391))) (let ((.cse8 (select (select .cse7 |c_~#gl_list~0.base|) .cse4)) (.cse9 (select (select .cse10 |c_~#gl_list~0.base|) .cse4))) (or (not (= (select (select .cse7 .cse8) .cse9) .cse8)) (not (= .cse9 (select (select .cse10 .cse8) .cse9))) (= .cse9 |c_~#gl_list~0.offset|)))))))))) is different from false [2023-02-15 19:29:49,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247232710] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:29:49,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:29:49,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2023-02-15 19:29:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211792941] [2023-02-15 19:29:49,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:29:49,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 19:29:49,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:29:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 19:29:49,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2180, Unknown=2, NotChecked=190, Total=2550 [2023-02-15 19:29:49,079 INFO L87 Difference]: Start difference. First operand 365 states and 411 transitions. Second operand has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 30 states have internal predecessors, (101), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:30:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:09,874 INFO L93 Difference]: Finished difference Result 589 states and 662 transitions. [2023-02-15 19:30:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 19:30:09,875 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 30 states have internal predecessors, (101), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2023-02-15 19:30:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:09,877 INFO L225 Difference]: With dead ends: 589 [2023-02-15 19:30:09,877 INFO L226 Difference]: Without dead ends: 586 [2023-02-15 19:30:09,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=844, Invalid=6811, Unknown=9, NotChecked=346, Total=8010 [2023-02-15 19:30:09,879 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 2128 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 5884 mSolverCounterSat, 264 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 6149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 5884 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:09,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 1215 Invalid, 6149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 5884 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2023-02-15 19:30:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-02-15 19:30:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 459. [2023-02-15 19:30:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 409 states have (on average 1.1344743276283618) internal successors, (464), 422 states have internal predecessors, (464), 36 states have call successors, (36), 16 states have call predecessors, (36), 13 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 19:30:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 520 transitions. [2023-02-15 19:30:09,982 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 520 transitions. Word has length 59 [2023-02-15 19:30:09,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:09,982 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 520 transitions. [2023-02-15 19:30:09,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 30 states have internal predecessors, (101), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 19:30:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 520 transitions. [2023-02-15 19:30:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 19:30:09,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:09,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:30:09,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 19:30:10,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 19:30:10,190 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash -678154033, now seen corresponding path program 1 times [2023-02-15 19:30:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:10,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204634721] [2023-02-15 19:30:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:30:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:30:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:11,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204634721] [2023-02-15 19:30:11,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204634721] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:30:11,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:30:11,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 19:30:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311326183] [2023-02-15 19:30:11,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:30:11,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 19:30:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 19:30:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:30:11,292 INFO L87 Difference]: Start difference. First operand 459 states and 520 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:30:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:12,222 INFO L93 Difference]: Finished difference Result 500 states and 565 transitions. [2023-02-15 19:30:12,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:30:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 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 60 [2023-02-15 19:30:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:12,237 INFO L225 Difference]: With dead ends: 500 [2023-02-15 19:30:12,238 INFO L226 Difference]: Without dead ends: 497 [2023-02-15 19:30:12,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:30:12,240 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 327 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:12,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 244 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:30:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-02-15 19:30:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 474. [2023-02-15 19:30:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 424 states have (on average 1.1273584905660377) internal successors, (478), 437 states have internal predecessors, (478), 36 states have call successors, (36), 16 states have call predecessors, (36), 13 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 19:30:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 534 transitions. [2023-02-15 19:30:12,376 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 534 transitions. Word has length 60 [2023-02-15 19:30:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:12,376 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 534 transitions. [2023-02-15 19:30:12,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:30:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 534 transitions. [2023-02-15 19:30:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 19:30:12,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:12,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:30:12,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 19:30:12,377 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:12,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 697431940, now seen corresponding path program 2 times [2023-02-15 19:30:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112551679] [2023-02-15 19:30:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:30:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:30:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:15,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:30:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:30:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:16,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112551679] [2023-02-15 19:30:16,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112551679] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:16,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197178451] [2023-02-15 19:30:16,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:30:16,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:16,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:30:16,087 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:30:16,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 19:30:16,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:30:16,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:30:16,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 263 conjunts are in the unsatisfiable core [2023-02-15 19:30:16,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:30:16,587 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:30:16,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:30:16,614 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-02-15 19:30:16,623 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-02-15 19:30:16,632 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 7 treesize of output 3 [2023-02-15 19:30:16,640 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 7 treesize of output 3 [2023-02-15 19:30:16,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:16,779 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 89 [2023-02-15 19:30:16,788 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 19:30:16,788 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2023-02-15 19:30:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:16,791 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 31 treesize of output 26 [2023-02-15 19:30:16,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:16,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 19:30:16,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:16,800 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 31 treesize of output 26 [2023-02-15 19:30:16,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:16,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 19:30:16,872 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:30:16,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2023-02-15 19:30:16,877 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 29 treesize of output 29 [2023-02-15 19:30:16,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:16,972 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 19:30:16,972 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 28 treesize of output 45 [2023-02-15 19:30:17,065 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 39 treesize of output 35 [2023-02-15 19:30:17,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2023-02-15 19:30:17,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2023-02-15 19:30:17,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 17 [2023-02-15 19:30:17,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,353 INFO L321 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2023-02-15 19:30:17,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 135 [2023-02-15 19:30:17,373 INFO L321 Elim1Store]: treesize reduction 80, result has 5.9 percent of original size [2023-02-15 19:30:17,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 164 [2023-02-15 19:30:17,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 97 [2023-02-15 19:30:17,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 142 [2023-02-15 19:30:17,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 44 treesize of output 43 [2023-02-15 19:30:17,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 19:30:17,412 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 36 treesize of output 35 [2023-02-15 19:30:17,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 81 treesize of output 57 [2023-02-15 19:30:17,431 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-02-15 19:30:17,559 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:30:17,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 352 treesize of output 301 [2023-02-15 19:30:17,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,570 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 73 treesize of output 75 [2023-02-15 19:30:17,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2023-02-15 19:30:17,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:30:17,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,753 INFO L321 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2023-02-15 19:30:17,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2023-02-15 19:30:17,850 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 25 treesize of output 25 [2023-02-15 19:30:17,862 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:30:17,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 70 [2023-02-15 19:30:17,924 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 19 treesize of output 7 [2023-02-15 19:30:17,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:17,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:30:17,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 19 [2023-02-15 19:30:18,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,106 INFO L321 Elim1Store]: treesize reduction 80, result has 24.5 percent of original size [2023-02-15 19:30:18,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 165 treesize of output 111 [2023-02-15 19:30:18,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,131 INFO L321 Elim1Store]: treesize reduction 90, result has 10.9 percent of original size [2023-02-15 19:30:18,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 126 [2023-02-15 19:30:18,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2023-02-15 19:30:18,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 119 [2023-02-15 19:30:18,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 31 [2023-02-15 19:30:18,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:30:18,249 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 19:30:18,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 112 [2023-02-15 19:30:18,268 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 50 treesize of output 48 [2023-02-15 19:30:18,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-02-15 19:30:18,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:30:18,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:18,847 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2023-02-15 19:30:18,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 40 [2023-02-15 19:30:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:30:18,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:30:19,362 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5094 Int) (v_ArrVal_5093 (Array Int Int)) (v_ArrVal_5092 (Array Int Int)) (v_ArrVal_5095 (Array Int Int)) (v_ArrVal_5062 (Array Int Int)) (v_ArrVal_5061 (Array Int Int)) (v_ArrVal_5097 (Array Int Int)) (|v_list_add___list_add_~next#1.offset_29| Int) (v_ArrVal_5096 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (.cse3 (+ |v_list_add___list_add_~next#1.offset_29| 4))) (let ((.cse1 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) (store (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5093) |c_~#gl_list~0.base| (store (select (store .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5097) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_5094))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5061)) (.cse5 (+ |c_~#gl_list~0.offset| 4))) (let ((.cse0 (select (select .cse1 |c_~#gl_list~0.base|) .cse5))) (= .cse0 (select (select .cse1 .cse0) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5095) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5092) |c_~#gl_list~0.base| (let ((.cse4 (+ |c_ULTIMATE.start_gl_insert_~node~1#1.offset| 4))) (store (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse3 .cse4)) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5096) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| .cse4))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_5062) |c_~#gl_list~0.base|) .cse5) 4)))))))) is different from false [2023-02-15 19:30:19,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197178451] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:19,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:30:19,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2023-02-15 19:30:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628349452] [2023-02-15 19:30:19,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:30:19,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 19:30:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:19,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 19:30:19,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1630, Unknown=24, NotChecked=82, Total=1892 [2023-02-15 19:30:19,365 INFO L87 Difference]: Start difference. First operand 474 states and 534 transitions. Second operand has 37 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 24 states have internal predecessors, (98), 8 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:30:22,867 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] [2023-02-15 19:30:26,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:30:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:30,659 INFO L93 Difference]: Finished difference Result 590 states and 657 transitions. [2023-02-15 19:30:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 19:30:30,659 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 24 states have internal predecessors, (98), 8 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 62 [2023-02-15 19:30:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:30,661 INFO L225 Difference]: With dead ends: 590 [2023-02-15 19:30:30,661 INFO L226 Difference]: Without dead ends: 587 [2023-02-15 19:30:30,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=506, Invalid=4025, Unknown=29, NotChecked=132, Total=4692 [2023-02-15 19:30:30,664 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1925 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 4564 mSolverCounterSat, 261 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1931 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 4885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4564 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:30,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1931 Valid, 1081 Invalid, 4885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 4564 Invalid, 60 Unknown, 0 Unchecked, 8.4s Time] [2023-02-15 19:30:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-02-15 19:30:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 482. [2023-02-15 19:30:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 430 states have (on average 1.1209302325581396) internal successors, (482), 443 states have internal predecessors, (482), 36 states have call successors, (36), 18 states have call predecessors, (36), 15 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 19:30:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 538 transitions. [2023-02-15 19:30:30,819 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 538 transitions. Word has length 62 [2023-02-15 19:30:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:30,819 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 538 transitions. [2023-02-15 19:30:30,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 24 states have internal predecessors, (98), 8 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 19:30:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 538 transitions. [2023-02-15 19:30:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 19:30:30,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:30,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:30:30,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:30:31,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:31,036 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash 558719418, now seen corresponding path program 1 times [2023-02-15 19:30:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:31,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200714886] [2023-02-15 19:30:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:30:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:30:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:32,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200714886] [2023-02-15 19:30:32,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200714886] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:30:32,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:30:32,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 19:30:32,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412667495] [2023-02-15 19:30:32,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:30:32,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 19:30:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:30:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 19:30:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-02-15 19:30:32,187 INFO L87 Difference]: Start difference. First operand 482 states and 538 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:30:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:30:33,456 INFO L93 Difference]: Finished difference Result 496 states and 552 transitions. [2023-02-15 19:30:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 19:30:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 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 63 [2023-02-15 19:30:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:30:33,457 INFO L225 Difference]: With dead ends: 496 [2023-02-15 19:30:33,458 INFO L226 Difference]: Without dead ends: 493 [2023-02-15 19:30:33,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-15 19:30:33,459 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 294 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 19:30:33,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 295 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 19:30:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-02-15 19:30:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 485. [2023-02-15 19:30:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 433 states have (on average 1.117782909930716) internal successors, (484), 446 states have internal predecessors, (484), 36 states have call successors, (36), 18 states have call predecessors, (36), 15 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-15 19:30:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 540 transitions. [2023-02-15 19:30:33,587 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 540 transitions. Word has length 63 [2023-02-15 19:30:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:30:33,587 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 540 transitions. [2023-02-15 19:30:33,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 19:30:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 540 transitions. [2023-02-15 19:30:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 19:30:33,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:30:33,588 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:30:33,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 19:30:33,588 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:30:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:30:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2065028395, now seen corresponding path program 2 times [2023-02-15 19:30:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:30:33,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959430135] [2023-02-15 19:30:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:30:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:30:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 19:30:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:35,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-02-15 19:30:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 19:30:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:30:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 19:30:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:30:35,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959430135] [2023-02-15 19:30:35,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959430135] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:30:35,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051733573] [2023-02-15 19:30:35,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:30:35,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:30:35,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:30:35,499 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:30:35,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 19:30:35,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:30:35,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:30:35,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 179 conjunts are in the unsatisfiable core [2023-02-15 19:30:35,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:30:36,011 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:30:36,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-02-15 19:30:36,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 19:30:36,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2023-02-15 19:30:36,144 INFO L321 Elim1Store]: treesize reduction 73, result has 3.9 percent of original size [2023-02-15 19:30:36,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 80 [2023-02-15 19:30:36,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,165 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:30:36,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 95 [2023-02-15 19:30:36,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,276 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 50 treesize of output 50 [2023-02-15 19:30:36,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2023-02-15 19:30:36,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2023-02-15 19:30:36,290 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-02-15 19:30:36,300 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 22 treesize of output 16 [2023-02-15 19:30:36,395 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:30:36,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 19:30:36,461 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 64 treesize of output 54 [2023-02-15 19:30:36,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2023-02-15 19:30:36,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,556 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 19:30:36,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 71 [2023-02-15 19:30:36,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,568 INFO L321 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-02-15 19:30:36,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 78 [2023-02-15 19:30:36,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:36,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2023-02-15 19:30:36,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:30:36,724 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2023-02-15 19:30:36,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 125 [2023-02-15 19:30:36,764 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:37,119 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:30:37,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:30:37,262 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-02-15 19:30:37,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 132 [2023-02-15 19:30:37,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:30:37,396 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:37,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:30:37,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:37,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:30:37,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 163 treesize of output 132 [2023-02-15 19:30:37,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:37,875 INFO L321 Elim1Store]: treesize reduction 142, result has 30.7 percent of original size [2023-02-15 19:30:37,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 216 treesize of output 159 [2023-02-15 19:30:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:37,937 INFO L321 Elim1Store]: treesize reduction 89, result has 45.4 percent of original size [2023-02-15 19:30:37,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 244 treesize of output 274 [2023-02-15 19:30:38,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:30:38,326 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-02-15 19:30:38,347 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:38,372 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:38,400 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-02-15 19:30:41,682 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-02-15 19:30:41,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 19:30:41,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:42,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-15 19:30:42,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 19:30:42,157 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:30:42,158 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 21 treesize of output 9 [2023-02-15 19:30:42,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:42,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:42,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:42,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:43,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:43,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:43,410 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:43,446 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:43,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:43,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:43,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:43,657 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:43,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 19:30:43,848 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:44,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:44,466 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 19:30:44,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:44,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 19:30:45,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:45,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:45,341 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:30:45,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2023-02-15 19:30:45,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:45,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:30:45,754 INFO L321 Elim1Store]: treesize reduction 156, result has 64.4 percent of original size [2023-02-15 19:30:45,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 34 case distinctions, treesize of input 184 treesize of output 397