./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/list-ext2-properties/list_and_tree_cnstr-2.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 --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 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:28:21,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:28:21,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:28:21,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:28:21,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:28:21,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:28:21,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:28:21,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:28:21,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:28:21,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:28:21,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:28:21,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:28:21,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:28:21,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:28:21,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:28:21,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:28:21,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:28:21,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:28:21,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:28:21,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:28:21,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:28:21,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:28:21,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:28:21,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:28:21,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:28:21,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:28:21,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:28:21,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:28:21,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:28:21,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:28:21,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:28:21,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:28:21,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:21,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:28:21,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:28:21,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:28:21,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:28:21,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:28:21,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:28:21,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:28:21,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:28:21,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:28:21,472 INFO L153 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 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 -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 [2024-11-11 19:28:21,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:28:21,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:28:21,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:28:21,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:28:21,752 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:28:21,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2024-11-11 19:28:23,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:28:23,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:28:23,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2024-11-11 19:28:23,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4225dfb6/4eeeee90a41c43568f67f03bfee05654/FLAG587a3e07b [2024-11-11 19:28:23,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4225dfb6/4eeeee90a41c43568f67f03bfee05654 [2024-11-11 19:28:23,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:28:23,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:28:23,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:23,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:28:23,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:28:23,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:23,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab60f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23, skipping insertion in model container [2024-11-11 19:28:23,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:23,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:28:23,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2024-11-11 19:28:23,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:23,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:28:23,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2024-11-11 19:28:23,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:23,920 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:28:23,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23 WrapperNode [2024-11-11 19:28:23,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:23,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:23,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:28:23,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:28:23,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:23,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:23,972 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 204 [2024-11-11 19:28:23,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:23,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:28:23,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:28:23,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:28:23,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:23,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:23,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,007 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 5, 10]. [2024-11-11 19:28:24,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:28:24,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:28:24,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:28:24,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:28:24,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (1/1) ... [2024-11-11 19:28:24,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:24,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:24,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:28:24,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:28:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-11 19:28:24,132 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-11 19:28:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:28:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:28:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 19:28:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:28:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:28:24,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 19:28:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:28:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:28:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:28:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:28:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 19:28:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:28:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:28:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 19:28:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:28:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:28:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:28:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 19:28:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:28:24,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:28:24,284 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:28:24,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:28:24,326 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-11 19:28:24,685 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-11 19:28:24,686 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:28:24,701 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:28:24,702 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-11 19:28:24,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:24 BoogieIcfgContainer [2024-11-11 19:28:24,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:28:24,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:28:24,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:28:24,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:28:24,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:28:23" (1/3) ... [2024-11-11 19:28:24,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7a516d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:24, skipping insertion in model container [2024-11-11 19:28:24,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:23" (2/3) ... [2024-11-11 19:28:24,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7a516d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:24, skipping insertion in model container [2024-11-11 19:28:24,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:24" (3/3) ... [2024-11-11 19:28:24,713 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2024-11-11 19:28:24,730 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:28:24,730 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:28:24,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:28:24,788 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1ba60dd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:28:24,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:28:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 50 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:28:24,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:24,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:24,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:24,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:24,804 INFO L85 PathProgramCache]: Analyzing trace with hash -146872147, now seen corresponding path program 1 times [2024-11-11 19:28:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134024963] [2024-11-11 19:28:24,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:25,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:25,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134024963] [2024-11-11 19:28:25,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134024963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:25,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:25,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:28:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752347453] [2024-11-11 19:28:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:25,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:28:25,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:28:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:28:25,094 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 50 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:25,121 INFO L93 Difference]: Finished difference Result 102 states and 160 transitions. [2024-11-11 19:28:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:28:25,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-11 19:28:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:25,130 INFO L225 Difference]: With dead ends: 102 [2024-11-11 19:28:25,130 INFO L226 Difference]: Without dead ends: 43 [2024-11-11 19:28:25,134 INFO L434 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 [2024-11-11 19:28:25,139 INFO L435 NwaCegarLoop]: 72 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, 72 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 [2024-11-11 19:28:25,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-11 19:28:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-11 19:28:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-11 19:28:25,182 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 16 [2024-11-11 19:28:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:25,183 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-11 19:28:25,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-11 19:28:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 19:28:25,185 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:25,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:25,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:28:25,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1237728308, now seen corresponding path program 1 times [2024-11-11 19:28:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225906995] [2024-11-11 19:28:25,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:25,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225906995] [2024-11-11 19:28:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225906995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:25,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:25,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:28:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267644873] [2024-11-11 19:28:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:28:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:28:25,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:28:25,317 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:25,338 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2024-11-11 19:28:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:28:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-11 19:28:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:25,340 INFO L225 Difference]: With dead ends: 71 [2024-11-11 19:28:25,341 INFO L226 Difference]: Without dead ends: 51 [2024-11-11 19:28:25,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:28:25,342 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:25,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-11 19:28:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-11 19:28:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-11 19:28:25,351 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 21 [2024-11-11 19:28:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:25,351 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-11 19:28:25,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-11 19:28:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:28:25,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:25,353 INFO L218 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] [2024-11-11 19:28:25,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:28:25,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:25,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1368149959, now seen corresponding path program 1 times [2024-11-11 19:28:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:25,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890861101] [2024-11-11 19:28:25,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890861101] [2024-11-11 19:28:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890861101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:25,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:28:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848982165] [2024-11-11 19:28:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:25,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:28:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:25,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:28:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:28:25,756 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:25,998 INFO L93 Difference]: Finished difference Result 129 states and 191 transitions. [2024-11-11 19:28:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:28:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:28:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:26,000 INFO L225 Difference]: With dead ends: 129 [2024-11-11 19:28:26,002 INFO L226 Difference]: Without dead ends: 93 [2024-11-11 19:28:26,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:28:26,003 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 70 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:26,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 178 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:28:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-11 19:28:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2024-11-11 19:28:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 73 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-11 19:28:26,021 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 27 [2024-11-11 19:28:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:26,021 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-11 19:28:26,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-11 19:28:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:28:26,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:26,023 INFO L218 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] [2024-11-11 19:28:26,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:28:26,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:26,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2109168887, now seen corresponding path program 1 times [2024-11-11 19:28:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741510083] [2024-11-11 19:28:26,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:26,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741510083] [2024-11-11 19:28:26,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741510083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:26,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:26,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:28:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559546047] [2024-11-11 19:28:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:26,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:28:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:28:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:28:26,215 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:26,286 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2024-11-11 19:28:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:28:26,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:28:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:26,288 INFO L225 Difference]: With dead ends: 91 [2024-11-11 19:28:26,289 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 19:28:26,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:28:26,290 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:26,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 192 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:28:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 19:28:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-11-11 19:28:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-11 19:28:26,310 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 27 [2024-11-11 19:28:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:26,311 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-11 19:28:26,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-11 19:28:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 19:28:26,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:26,315 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:28:26,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash -264583150, now seen corresponding path program 1 times [2024-11-11 19:28:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:26,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495611529] [2024-11-11 19:28:26,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:26,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495611529] [2024-11-11 19:28:26,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495611529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:26,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:26,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:28:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683532016] [2024-11-11 19:28:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:26,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:28:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:28:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:28:26,474 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:26,527 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2024-11-11 19:28:26,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:28:26,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 19:28:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:26,529 INFO L225 Difference]: With dead ends: 93 [2024-11-11 19:28:26,529 INFO L226 Difference]: Without dead ends: 85 [2024-11-11 19:28:26,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:28:26,530 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:26,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-11 19:28:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-11 19:28:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.475) internal successors, (118), 80 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-11 19:28:26,538 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 29 [2024-11-11 19:28:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:26,538 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-11 19:28:26,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-11 19:28:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 19:28:26,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:26,539 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:26,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:28:26,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:26,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:26,541 INFO L85 PathProgramCache]: Analyzing trace with hash 760119826, now seen corresponding path program 1 times [2024-11-11 19:28:26,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:26,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829691458] [2024-11-11 19:28:26,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:26,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829691458] [2024-11-11 19:28:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829691458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:26,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:26,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:28:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622895825] [2024-11-11 19:28:26,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:26,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:28:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:28:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:28:26,664 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:26,715 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2024-11-11 19:28:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:28:26,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 19:28:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:26,717 INFO L225 Difference]: With dead ends: 93 [2024-11-11 19:28:26,717 INFO L226 Difference]: Without dead ends: 82 [2024-11-11 19:28:26,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:28:26,718 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:26,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-11 19:28:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-11 19:28:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 77 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-11-11 19:28:26,727 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 29 [2024-11-11 19:28:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:26,731 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-11-11 19:28:26,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-11-11 19:28:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 19:28:26,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:26,732 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:26,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 19:28:26,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash -219954082, now seen corresponding path program 1 times [2024-11-11 19:28:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628269932] [2024-11-11 19:28:26,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:27,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628269932] [2024-11-11 19:28:27,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628269932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048097015] [2024-11-11 19:28:27,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:27,040 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) [2024-11-11 19:28:27,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:28:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:27,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 19:28:27,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:27,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:28:27,311 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:28:27,312 INFO L378 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 [2024-11-11 19:28:27,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:28:27,378 INFO L378 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 27 treesize of output 11 [2024-11-11 19:28:27,405 INFO L378 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 11 [2024-11-11 19:28:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:27,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:27,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_202 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2024-11-11 19:28:28,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:28,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-11 19:28:28,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:28,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-11 19:28:28,603 INFO L378 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 [2024-11-11 19:28:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-11 19:28:28,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048097015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:28,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:28,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-11 19:28:28,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699160674] [2024-11-11 19:28:28,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:28,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 19:28:28,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:28,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 19:28:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=83, Unknown=3, NotChecked=18, Total=132 [2024-11-11 19:28:28,742 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:29,332 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2024-11-11 19:28:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 19:28:29,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 19:28:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:29,333 INFO L225 Difference]: With dead ends: 95 [2024-11-11 19:28:29,333 INFO L226 Difference]: Without dead ends: 91 [2024-11-11 19:28:29,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=180, Unknown=3, NotChecked=28, Total=272 [2024-11-11 19:28:29,335 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:29,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 393 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 126 Invalid, 0 Unknown, 36 Unchecked, 0.5s Time] [2024-11-11 19:28:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-11 19:28:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-11 19:28:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 86 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2024-11-11 19:28:29,342 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 31 [2024-11-11 19:28:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:29,343 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2024-11-11 19:28:29,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2024-11-11 19:28:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 19:28:29,344 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:29,344 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:29,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 19:28:29,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:29,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:29,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash 643447582, now seen corresponding path program 1 times [2024-11-11 19:28:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357261749] [2024-11-11 19:28:29,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357261749] [2024-11-11 19:28:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357261749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508562317] [2024-11-11 19:28:29,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:29,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:29,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:29,820 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) [2024-11-11 19:28:29,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:28:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:29,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-11 19:28:29,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:29,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:28:29,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:28:29,994 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:28:29,995 INFO L378 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 [2024-11-11 19:28:30,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-11 19:28:30,057 INFO L378 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 11 [2024-11-11 19:28:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:30,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:30,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:30,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-11 19:28:30,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:30,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-11 19:28:30,192 INFO L378 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 [2024-11-11 19:28:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:30,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508562317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:30,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:30,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-11 19:28:30,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918135753] [2024-11-11 19:28:30,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:30,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:28:30,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:30,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:28:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=118, Unknown=5, NotChecked=0, Total=156 [2024-11-11 19:28:30,269 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:31,129 INFO L93 Difference]: Finished difference Result 99 states and 138 transitions. [2024-11-11 19:28:31,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 19:28:31,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 19:28:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:31,130 INFO L225 Difference]: With dead ends: 99 [2024-11-11 19:28:31,130 INFO L226 Difference]: Without dead ends: 93 [2024-11-11 19:28:31,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=199, Unknown=7, NotChecked=0, Total=272 [2024-11-11 19:28:31,131 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 38 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:31,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 335 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 19:28:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-11 19:28:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-11 19:28:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-11 19:28:31,140 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 31 [2024-11-11 19:28:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:31,140 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-11 19:28:31,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-11 19:28:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-11 19:28:31,142 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:31,142 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 19:28:31,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:28:31,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-11 19:28:31,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:31,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash -873795143, now seen corresponding path program 1 times [2024-11-11 19:28:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:31,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240213539] [2024-11-11 19:28:31,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240213539] [2024-11-11 19:28:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240213539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577570834] [2024-11-11 19:28:31,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:31,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:31,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:31,850 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) [2024-11-11 19:28:31,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:28:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:31,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-11 19:28:31,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:31,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:28:32,038 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:28:32,039 INFO L378 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 [2024-11-11 19:28:32,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-11 19:28:32,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-11 19:28:32,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-11 19:28:32,153 INFO L378 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 80 treesize of output 73 [2024-11-11 19:28:32,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-11 19:28:32,163 INFO L378 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 40 treesize of output 23 [2024-11-11 19:28:32,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-11 19:28:32,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:28:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:32,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:32,327 INFO L378 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 132 treesize of output 88 [2024-11-11 19:28:32,337 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_356 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_357 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2024-11-11 19:28:32,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:32,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-11 19:28:32,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:32,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-11 19:28:32,377 INFO L378 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 [2024-11-11 19:28:32,393 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:32,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-11 19:28:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-11 19:28:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577570834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:32,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 22 [2024-11-11 19:28:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763422366] [2024-11-11 19:28:32,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:32,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 19:28:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 19:28:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-11-11 19:28:32,519 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:32,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:32,966 INFO L93 Difference]: Finished difference Result 125 states and 169 transitions. [2024-11-11 19:28:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 19:28:32,967 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-11 19:28:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:32,968 INFO L225 Difference]: With dead ends: 125 [2024-11-11 19:28:32,968 INFO L226 Difference]: Without dead ends: 113 [2024-11-11 19:28:32,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=592, Unknown=1, NotChecked=50, Total=756 [2024-11-11 19:28:32,969 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:32,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 631 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 357 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2024-11-11 19:28:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-11 19:28:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-11-11 19:28:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-11 19:28:32,977 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 33 [2024-11-11 19:28:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:32,978 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-11 19:28:32,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-11 19:28:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 19:28:32,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:32,979 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:28:32,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 19:28:33,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:33,180 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:33,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash 66922580, now seen corresponding path program 1 times [2024-11-11 19:28:33,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:33,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898567300] [2024-11-11 19:28:33,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:33,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:28:33,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898567300] [2024-11-11 19:28:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898567300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235114378] [2024-11-11 19:28:33,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:33,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:33,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:33,453 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) [2024-11-11 19:28:33,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:28:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:33,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-11 19:28:33,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:33,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:28:33,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:28:33,639 INFO L378 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 [2024-11-11 19:28:33,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:28:33,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-11 19:28:33,692 INFO L378 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 11 [2024-11-11 19:28:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:28:33,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:33,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-11-11 19:28:33,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:33,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2024-11-11 19:28:33,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:33,770 INFO L378 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 33 treesize of output 36 [2024-11-11 19:28:33,775 INFO L378 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 20 treesize of output 18 [2024-11-11 19:28:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-11-11 19:28:33,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235114378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:33,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:33,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-11 19:28:33,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624163329] [2024-11-11 19:28:33,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:33,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 19:28:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:33,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 19:28:33,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-11 19:28:33,861 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:34,089 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2024-11-11 19:28:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 19:28:34,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-11 19:28:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:34,090 INFO L225 Difference]: With dead ends: 115 [2024-11-11 19:28:34,090 INFO L226 Difference]: Without dead ends: 102 [2024-11-11 19:28:34,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=236, Unknown=1, NotChecked=32, Total=342 [2024-11-11 19:28:34,092 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:34,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 519 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2024-11-11 19:28:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-11 19:28:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-11 19:28:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2024-11-11 19:28:34,106 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 35 [2024-11-11 19:28:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:34,106 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2024-11-11 19:28:34,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2024-11-11 19:28:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 19:28:34,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:34,107 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:28:34,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:28:34,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:34,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:34,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash 366624532, now seen corresponding path program 1 times [2024-11-11 19:28:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129864122] [2024-11-11 19:28:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:34,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129864122] [2024-11-11 19:28:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129864122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:34,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355209051] [2024-11-11 19:28:34,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:34,815 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) [2024-11-11 19:28:34,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:28:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:34,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-11 19:28:34,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:34,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:28:34,990 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:28:34,991 INFO L378 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 [2024-11-11 19:28:35,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-11 19:28:35,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-11 19:28:35,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-11 19:28:35,092 INFO L378 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 80 treesize of output 73 [2024-11-11 19:28:35,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-11-11 19:28:35,099 INFO L378 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 40 treesize of output 23 [2024-11-11 19:28:35,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-11 19:28:35,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:28:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:35,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:35,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2024-11-11 19:28:35,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_513 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_512 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2024-11-11 19:28:35,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:35,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-11 19:28:35,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:35,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-11 19:28:35,272 INFO L378 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 [2024-11-11 19:28:35,278 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:35,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-11 19:28:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-11 19:28:35,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355209051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:35,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:35,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-11-11 19:28:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022445774] [2024-11-11 19:28:35,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:35,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 19:28:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 19:28:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2024-11-11 19:28:35,355 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:35,719 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2024-11-11 19:28:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 19:28:35,720 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-11 19:28:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:35,720 INFO L225 Difference]: With dead ends: 118 [2024-11-11 19:28:35,720 INFO L226 Difference]: Without dead ends: 105 [2024-11-11 19:28:35,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2024-11-11 19:28:35,722 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 86 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:35,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 569 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 263 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2024-11-11 19:28:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-11 19:28:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2024-11-11 19:28:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2024-11-11 19:28:35,728 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 35 [2024-11-11 19:28:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:35,729 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2024-11-11 19:28:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-11-11 19:28:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 19:28:35,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:35,730 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:28:35,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:28:35,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 19:28:35,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:35,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1701842976, now seen corresponding path program 2 times [2024-11-11 19:28:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:35,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511743337] [2024-11-11 19:28:35,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511743337] [2024-11-11 19:28:36,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511743337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552960640] [2024-11-11 19:28:36,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:28:36,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:36,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:36,708 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) [2024-11-11 19:28:36,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:28:36,835 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:28:36,835 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:28:36,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-11 19:28:36,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:36,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:28:36,893 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:28:36,893 INFO L378 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 [2024-11-11 19:28:36,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:28:36,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:28:37,006 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 19:28:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-11 19:28:37,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:28:37,031 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-11 19:28:37,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-11 19:28:37,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-11 19:28:37,110 INFO L378 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 93 treesize of output 80 [2024-11-11 19:28:37,119 INFO L378 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 27 treesize of output 22 [2024-11-11 19:28:37,127 INFO L378 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 39 treesize of output 15 [2024-11-11 19:28:37,211 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2024-11-11 19:28:37,211 INFO L378 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 23 treesize of output 30 [2024-11-11 19:28:37,229 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 19:28:37,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2024-11-11 19:28:37,257 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2024-11-11 19:28:37,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2024-11-11 19:28:37,281 INFO L378 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 37 treesize of output 27 [2024-11-11 19:28:37,711 INFO L378 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 58 treesize of output 38 [2024-11-11 19:28:37,719 INFO L378 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 30 [2024-11-11 19:28:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:37,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:42,419 INFO L349 Elim1Store]: treesize reduction 4, result has 90.0 percent of original size [2024-11-11 19:28:42,419 INFO L378 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 1718 treesize of output 1656 [2024-11-11 19:28:42,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:42,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 369 treesize of output 358 [2024-11-11 19:28:42,552 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:42,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:42,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2024-11-11 19:28:42,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:42,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2024-11-11 19:28:42,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:42,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2024-11-11 19:28:42,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:42,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 11 [2024-11-11 19:28:43,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:43,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 11 [2024-11-11 19:28:43,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:43,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 11 [2024-11-11 19:28:44,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-11 19:28:49,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) (.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse57) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse57) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse57)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse58 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse58) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse58) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse58)))) (not (= (select v_arrayElimArr_8 4) 0)) (not (= (select v_arrayElimArr_8 .cse2) 0)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse59 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse59) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse59)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int))) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse60 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse60) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse60) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse60)))) (not (= (select v_arrayElimArr_8 .cse2) 0))))))) .cse19) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse61 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse61 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse61)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse62) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse62) (not (= (select v_arrayElimArr_8 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (or (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse63 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse63 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse63)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse64 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_8 4) 0)) (= 0 .cse64) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse64)))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse65) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse65)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse66 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse66 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse66)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse67 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse67) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse67)))))))) (.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) (.cse23 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (not (= .cse2 0)))) (and (or .cse0 .cse1) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse3) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) (not (= (select v_arrayElimArr_8 .cse2) 0))))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse5 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse5)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_8 .cse2) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse6)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (or (not (= (select v_arrayElimArr_8 4) 0)) (not (= (select v_arrayElimArr_8 .cse2) 0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse7) (= 0 .cse7) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse7) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse7)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse8) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) (not (= (select v_arrayElimArr_8 .cse2) 0))))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse9 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_8 .cse2) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse10) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse10)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse11) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) (not (= (select v_arrayElimArr_8 0) 0)) (= (+ 4 .cse11) 0)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse12) (not (= (select v_arrayElimArr_8 0) 0)) (= (+ 4 .cse12) 0)))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse13 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse13 |c_ULTIMATE.start_main_~p~0#1.base|)))))))) .cse14) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse15) (= 0 .cse15) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse15) (not (= (select v_arrayElimArr_8 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse16) (not (= (select v_arrayElimArr_8 4) 0)) (= 0 .cse16) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse16)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int))) (or (not (= (select v_arrayElimArr_8 .cse2) 0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse17) (= 0 .cse17) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse17)))))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse18) (= 0 .cse18) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse18)))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse19) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse20 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse21) (= 0 .cse21) (not (= (select v_arrayElimArr_8 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse22 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse22)))))) (or .cse1 .cse23) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse24) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse24)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse25 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse25)))))) (or (let ((.cse35 (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse46)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse47) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) (not (= (select v_arrayElimArr_8 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse48 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse48) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse48) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse48)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (or (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse49 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse49)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse50 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse50) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse50)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse51)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse52) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse52)))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse53 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse53) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse53) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse53)))) (not (= (select v_arrayElimArr_8 4) 0)) (not (= (select v_arrayElimArr_8 .cse2) 0)))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse54 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse54) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse54)))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse55 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse55) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse55) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse55)))) (not (= (select v_arrayElimArr_8 .cse2) 0))))) .cse19) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_8 4) 0)) (= 0 .cse56) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse56)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))))))) (and (forall ((v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (not (= (select v_arrayElimArr_8 4) 0)) (not (= (select v_arrayElimArr_8 .cse2) 0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse26) (= 0 .cse26) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse26) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse26)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse27) (= 0 .cse27) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse27) (not (= (select v_arrayElimArr_8 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse28) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) (not (= (select v_arrayElimArr_8 .cse2) 0))))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse29) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse29) (not (= (select v_arrayElimArr_8 .cse2) 0))))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse30 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse30)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse31 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse31) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse31)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse32 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse32)))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse33 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse33) (= 0 .cse33) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse33)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (not (= (select v_arrayElimArr_8 .cse2) 0)) (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse34) (= 0 .cse34) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse34) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse34))))))) .cse19) (or .cse0 .cse35) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_8 .cse2) 0)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse36 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse36 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse36)))))) (forall ((v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse37 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse37 |c_ULTIMATE.start_main_~p~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_59| .cse37)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse38 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse38) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse38)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse39 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse39 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse40 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse40) (= 0 .cse40) (not (= (select v_arrayElimArr_8 .cse2) 0))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse41 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse41 |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)) (not (= (select v_arrayElimArr_8 .cse2) 0)))))) (or .cse35 .cse23) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse42 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse2 .cse42) (not (= (select v_arrayElimArr_8 4) 0)) (= 0 .cse42) (not (= (select v_arrayElimArr_8 .cse2) 0)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse42)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~a~0#1.base|)))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse43) (not (= (select v_arrayElimArr_8 0) 0)) (= (+ 4 .cse43) 0)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (let ((.cse44 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) (not (= .cse44 |c_ULTIMATE.start_main_~p~0#1.base|))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int)) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (let ((.cse45 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_626) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= 0 .cse45) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) (not (= (select v_arrayElimArr_8 0) 0)) (= (+ 4 .cse45) 0)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_621) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_628) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)))))) .cse14))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))) is different from false [2024-11-11 19:28:51,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 58 [2024-11-11 19:28:51,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-11 19:28:51,760 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:51,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,780 INFO L378 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 90 treesize of output 77 [2024-11-11 19:28:51,821 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-11 19:28:51,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2024-11-11 19:28:51,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:51,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-11 19:28:51,860 INFO L378 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 [2024-11-11 19:28:51,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-11 19:28:51,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2024-11-11 19:28:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:51,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:51,895 INFO L378 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 18 treesize of output 12 [2024-11-11 19:28:51,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,904 INFO L378 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 16 treesize of output 16 [2024-11-11 19:28:51,912 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:51,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2024-11-11 19:28:51,927 INFO L378 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 [2024-11-11 19:28:51,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 60 [2024-11-11 19:28:51,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:51,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-11 19:28:51,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:52,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:52,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:52,010 INFO L378 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 92 treesize of output 68 [2024-11-11 19:28:52,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-11 19:28:52,024 INFO L378 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 [2024-11-11 19:28:52,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-11 19:28:52,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:52,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-11 19:28:52,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:52,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2024-11-11 19:28:52,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:52,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:52,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:52,056 INFO L378 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 61 treesize of output 43 [2024-11-11 19:28:52,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-11 19:28:52,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-11 19:28:52,067 INFO L378 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 [2024-11-11 19:28:52,070 INFO L378 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 [2024-11-11 19:28:52,078 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2024-11-11 19:28:52,086 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2024-11-11 19:28:52,102 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2024-11-11 19:28:52,117 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 19:28:52,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2024-11-11 19:28:52,127 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-11 19:28:52,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2024-11-11 19:28:52,135 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2024-11-11 19:28:52,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:52,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 50 [2024-11-11 19:28:52,146 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:52,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:52,156 INFO L378 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 74 treesize of output 67 [2024-11-11 19:28:52,164 INFO L378 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 [2024-11-11 19:28:52,188 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:28:52,203 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2024-11-11 19:28:52,215 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2024-11-11 19:28:52,229 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 1 [2024-11-11 19:28:52,235 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:28:52,241 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:28:52,258 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,271 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,285 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,299 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,313 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2024-11-11 19:28:52,324 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,334 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,339 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:28:52,368 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,383 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,396 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,409 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,424 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2024-11-11 19:28:52,438 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,448 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-11 19:28:52,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 1 [2024-11-11 19:28:52,457 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:28:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-11 19:28:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552960640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:52,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 34 [2024-11-11 19:28:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22285563] [2024-11-11 19:28:52,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-11 19:28:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:52,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-11 19:28:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=4, NotChecked=62, Total=1122 [2024-11-11 19:28:52,645 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:54,252 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2024-11-11 19:28:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 19:28:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-11 19:28:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:54,253 INFO L225 Difference]: With dead ends: 127 [2024-11-11 19:28:54,253 INFO L226 Difference]: Without dead ends: 123 [2024-11-11 19:28:54,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=222, Invalid=1848, Unknown=4, NotChecked=88, Total=2162 [2024-11-11 19:28:54,255 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 102 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:54,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 888 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 523 Invalid, 2 Unknown, 84 Unchecked, 0.6s Time] [2024-11-11 19:28:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-11 19:28:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2024-11-11 19:28:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2024-11-11 19:28:54,262 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 37 [2024-11-11 19:28:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:54,262 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2024-11-11 19:28:54,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 34 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2024-11-11 19:28:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 19:28:54,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:54,263 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 19:28:54,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 19:28:54,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:54,468 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:54,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -426372960, now seen corresponding path program 1 times [2024-11-11 19:28:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:54,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126990048] [2024-11-11 19:28:54,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:54,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:55,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126990048] [2024-11-11 19:28:55,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126990048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:55,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386420608] [2024-11-11 19:28:55,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:55,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:55,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:55,273 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) [2024-11-11 19:28:55,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:28:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:55,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-11 19:28:55,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:55,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:28:55,468 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:28:55,469 INFO L378 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 [2024-11-11 19:28:55,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:28:55,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:28:55,669 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-11 19:28:55,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-11 19:28:55,688 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-11 19:28:55,689 INFO L378 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 [2024-11-11 19:28:55,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:55,704 INFO L378 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 16 treesize of output 11 [2024-11-11 19:28:55,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:28:55,807 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-11 19:28:55,807 INFO L378 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 201 treesize of output 147 [2024-11-11 19:28:55,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 124 [2024-11-11 19:28:55,827 INFO L378 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 55 treesize of output 19 [2024-11-11 19:28:55,923 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-11 19:28:55,923 INFO L378 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 192 treesize of output 153 [2024-11-11 19:28:55,948 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2024-11-11 19:28:55,948 INFO L378 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 142 [2024-11-11 19:28:55,959 INFO L378 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 55 treesize of output 40 [2024-11-11 19:28:56,090 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-11 19:28:56,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 50 [2024-11-11 19:28:56,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2024-11-11 19:28:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:28:56,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:56,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:56,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 79 [2024-11-11 19:28:56,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:56,480 INFO L378 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 1492 treesize of output 1442 [2024-11-11 19:28:56,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:56,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 418 treesize of output 386 [2024-11-11 19:28:56,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-11 19:28:56,784 INFO L378 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 72 treesize of output 56 [2024-11-11 19:28:58,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2024-11-11 19:28:58,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,021 INFO L378 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 323 treesize of output 226 [2024-11-11 19:28:58,026 INFO L378 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 109 treesize of output 101 [2024-11-11 19:28:58,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,040 INFO L378 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 101 treesize of output 102 [2024-11-11 19:28:58,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,053 INFO L378 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 93 treesize of output 94 [2024-11-11 19:28:58,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-11 19:28:58,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-11 19:28:58,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:58,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:58,505 INFO L378 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 21 treesize of output 15 [2024-11-11 19:28:58,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:58,509 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:58,510 INFO L378 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 21 treesize of output 15 [2024-11-11 19:28:58,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:28:58,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-11 19:28:58,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-11 19:28:58,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-11 19:28:58,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:58,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:58,551 INFO L378 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 21 treesize of output 15 [2024-11-11 19:28:58,557 INFO L378 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 9 [2024-11-11 19:28:58,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:58,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:58,566 INFO L378 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 21 treesize of output 15 [2024-11-11 19:28:58,571 INFO L378 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 24 treesize of output 14 [2024-11-11 19:28:58,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-11 19:28:58,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:58,598 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:58,601 INFO L378 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 22 treesize of output 16 [2024-11-11 19:28:58,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2024-11-11 19:28:58,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-11 19:28:58,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:58,624 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:58,627 INFO L378 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 22 treesize of output 16 [2024-11-11 19:28:58,637 INFO L378 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 16 treesize of output 10 [2024-11-11 19:28:58,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2024-11-11 19:28:58,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,673 INFO L378 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 581 treesize of output 436 [2024-11-11 19:28:58,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 196 [2024-11-11 19:28:58,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,705 INFO L378 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 185 treesize of output 186 [2024-11-11 19:28:58,714 INFO L378 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 177 treesize of output 169 [2024-11-11 19:28:58,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,736 INFO L378 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 520 treesize of output 501 [2024-11-11 19:28:58,749 INFO L378 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 233 treesize of output 225 [2024-11-11 19:28:58,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,767 INFO L378 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 225 treesize of output 194 [2024-11-11 19:28:58,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,786 INFO L378 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 185 treesize of output 174 [2024-11-11 19:28:58,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:58,804 INFO L378 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 165 treesize of output 166 [2024-11-11 19:28:59,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:59,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 82 [2024-11-11 19:28:59,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:59,632 INFO L378 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 350 treesize of output 331 [2024-11-11 19:28:59,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:59,649 INFO L378 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 113 treesize of output 106 [2024-11-11 19:28:59,655 INFO L378 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 97 treesize of output 89 [2024-11-11 19:28:59,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:59,668 INFO L378 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 89 treesize of output 86 [2024-11-11 19:28:59,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:59,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-11 19:28:59,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:59,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:59,970 INFO L378 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 18 treesize of output 12 [2024-11-11 19:28:59,972 INFO L378 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 21 treesize of output 13 [2024-11-11 19:28:59,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:59,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-11 19:28:59,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:28:59,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:28:59,985 INFO L378 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 18 treesize of output 12 [2024-11-11 19:28:59,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2024-11-11 19:29:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:29:01,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386420608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:01,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:01,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2024-11-11 19:29:01,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580886875] [2024-11-11 19:29:01,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-11 19:29:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:01,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-11 19:29:01,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-11-11 19:29:01,785 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:02,872 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2024-11-11 19:29:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 19:29:02,872 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-11 19:29:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:02,873 INFO L225 Difference]: With dead ends: 135 [2024-11-11 19:29:02,873 INFO L226 Difference]: Without dead ends: 131 [2024-11-11 19:29:02,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2024-11-11 19:29:02,874 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 106 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:02,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 586 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 19:29:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-11 19:29:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 117. [2024-11-11 19:29:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2024-11-11 19:29:02,884 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 158 transitions. Word has length 37 [2024-11-11 19:29:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:02,884 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 158 transitions. [2024-11-11 19:29:02,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2024-11-11 19:29:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 19:29:02,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:02,885 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2024-11-11 19:29:02,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 19:29:03,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:03,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:03,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash 373938016, now seen corresponding path program 2 times [2024-11-11 19:29:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:03,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882276896] [2024-11-11 19:29:03,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882276896] [2024-11-11 19:29:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882276896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196770218] [2024-11-11 19:29:03,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:29:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:03,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:03,841 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) [2024-11-11 19:29:03,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 19:29:03,963 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:29:03,964 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:03,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-11 19:29:03,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:03,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:29:04,006 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:29:04,006 INFO L378 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 [2024-11-11 19:29:04,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:29:04,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:29:04,119 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-11 19:29:04,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-11 19:29:04,134 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-11 19:29:04,134 INFO L378 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 [2024-11-11 19:29:04,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 19:29:04,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:29:04,147 INFO L378 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 16 treesize of output 11 [2024-11-11 19:29:04,204 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-11 19:29:04,205 INFO L378 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 175 treesize of output 125 [2024-11-11 19:29:04,208 INFO L378 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 128 treesize of output 105 [2024-11-11 19:29:04,217 INFO L378 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 55 treesize of output 19 [2024-11-11 19:29:04,313 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-11 19:29:04,314 INFO L378 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 172 treesize of output 135 [2024-11-11 19:29:04,325 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-11 19:29:04,325 INFO L378 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 128 treesize of output 121 [2024-11-11 19:29:04,332 INFO L378 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 52 treesize of output 19 [2024-11-11 19:29:04,373 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-11 19:29:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2024-11-11 19:29:04,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:29:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:29:04,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:04,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (= 1 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_858) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_857) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-11 19:29:04,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_856 Int) (v_ArrVal_852 (Array Int Int))) (= 1 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_856)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_858) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_852) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_857) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2024-11-11 19:29:04,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2024-11-11 19:29:04,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2024-11-11 19:29:04,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 121 [2024-11-11 19:29:04,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2024-11-11 19:29:04,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-11 19:29:04,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-11-11 19:29:04,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,595 INFO L378 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 107 treesize of output 106 [2024-11-11 19:29:04,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2024-11-11 19:29:04,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,606 INFO L378 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 93 treesize of output 61 [2024-11-11 19:29:04,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-11 19:29:04,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:04,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-11 19:29:04,687 INFO L378 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 [2024-11-11 19:29:04,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-11 19:29:04,709 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:04,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-11-11 19:29:04,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2024-11-11 19:29:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-11 19:29:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196770218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:05,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:05,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-11-11 19:29:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579132962] [2024-11-11 19:29:05,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:05,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 19:29:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:05,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 19:29:05,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=478, Unknown=3, NotChecked=90, Total=650 [2024-11-11 19:29:05,215 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:05,736 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2024-11-11 19:29:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 19:29:05,737 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-11 19:29:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:05,737 INFO L225 Difference]: With dead ends: 138 [2024-11-11 19:29:05,738 INFO L226 Difference]: Without dead ends: 132 [2024-11-11 19:29:05,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=695, Unknown=3, NotChecked=110, Total=930 [2024-11-11 19:29:05,738 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 84 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:05,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 680 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 432 Invalid, 0 Unknown, 169 Unchecked, 0.4s Time] [2024-11-11 19:29:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-11 19:29:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-11-11 19:29:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.352) internal successors, (169), 125 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 169 transitions. [2024-11-11 19:29:05,746 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 169 transitions. Word has length 37 [2024-11-11 19:29:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:05,746 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 169 transitions. [2024-11-11 19:29:05,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 169 transitions. [2024-11-11 19:29:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 19:29:05,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:05,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-11 19:29:05,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-11 19:29:05,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 19:29:05,948 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:05,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 960119995, now seen corresponding path program 3 times [2024-11-11 19:29:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402744360] [2024-11-11 19:29:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402744360] [2024-11-11 19:29:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402744360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163490172] [2024-11-11 19:29:06,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:29:06,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:06,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:06,820 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) [2024-11-11 19:29:06,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 19:29:07,001 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 19:29:07,002 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:07,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-11 19:29:07,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:07,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 19:29:07,077 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:29:07,077 INFO L378 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 [2024-11-11 19:29:07,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:29:07,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:29:07,194 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 19:29:07,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-11 19:29:07,197 INFO L378 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 [2024-11-11 19:29:07,210 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-11 19:29:07,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-11 19:29:07,225 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-11 19:29:07,225 INFO L378 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 [2024-11-11 19:29:07,282 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-11 19:29:07,282 INFO L378 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 161 treesize of output 119 [2024-11-11 19:29:07,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2024-11-11 19:29:07,374 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-11 19:29:07,375 INFO L378 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 174 treesize of output 137 [2024-11-11 19:29:07,392 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2024-11-11 19:29:07,393 INFO L378 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 130 treesize of output 126 [2024-11-11 19:29:07,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2024-11-11 19:29:07,527 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-11 19:29:07,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 49 [2024-11-11 19:29:07,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-11 19:29:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:29:07,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:07,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 129 [2024-11-11 19:29:07,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_972))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_971))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2024-11-11 19:29:07,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_81| Int) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_971))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_81|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_972) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~t~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_81| Int) (v_ArrVal_971 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (= |v_ULTIMATE.start_main_~p~0#1.offset_81| (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~p~0#1.offset_81|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_972))) (select (select .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_971) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))))) is different from false [2024-11-11 19:29:07,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:07,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 124 [2024-11-11 19:29:07,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:07,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 92 [2024-11-11 19:29:07,647 INFO L378 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 13 treesize of output 1 [2024-11-11 19:29:07,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:07,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2024-11-11 19:29:07,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:07,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 90 [2024-11-11 19:29:07,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:07,751 INFO L378 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 638 treesize of output 451 [2024-11-11 19:29:08,349 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2024-11-11 19:29:08,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 5576 treesize of output 5399 [2024-11-11 19:29:08,474 INFO L378 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 418 treesize of output 358 [2024-11-11 19:29:08,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:08,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 660 treesize of output 576 [2024-11-11 19:29:08,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:08,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 562 treesize of output 422 [2024-11-11 19:29:08,693 INFO L378 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 247 treesize of output 171