./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:44:39,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:44:39,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:44:39,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:44:39,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:44:39,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:44:39,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:44:39,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:44:39,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:44:39,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:44:39,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:44:39,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:44:39,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:44:39,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:44:39,286 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:44:39,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:44:39,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:44:39,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:44:39,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:44:39,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:44:39,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:44:39,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:44:39,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:44:39,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:44:39,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:44:39,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:44:39,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:44:39,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:44:39,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:44:39,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:44:39,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:44:39,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:44:39,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:44:39,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:44:39,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:44:39,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:44:39,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:44:39,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:44:39,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:44:39,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:44:39,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:44:39,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:44:39,299 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-clean/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-clean/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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-10-11 01:44:39,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:44:39,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:44:39,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:44:39,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:44:39,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:44:39,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-10-11 01:44:41,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:44:41,305 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:44:41,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-10-11 01:44:41,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/956808f3c/e1bdc2a9e43d415a9fb28d16be901f6b/FLAG9fd66bb0b [2024-10-11 01:44:41,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/956808f3c/e1bdc2a9e43d415a9fb28d16be901f6b [2024-10-11 01:44:41,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:44:41,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:44:41,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:44:41,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:44:41,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:44:41,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:41" (1/1) ... [2024-10-11 01:44:41,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40021167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:41, skipping insertion in model container [2024-10-11 01:44:41,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:44:41" (1/1) ... [2024-10-11 01:44:41,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:44:42,003 WARN L248 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-simple/sll2n_prepend_equal.i[24076,24089] [2024-10-11 01:44:42,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:44:42,019 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:44:42,066 WARN L248 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-simple/sll2n_prepend_equal.i[24076,24089] [2024-10-11 01:44:42,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:44:42,103 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:44:42,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42 WrapperNode [2024-10-11 01:44:42,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:44:42,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:44:42,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:44:42,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:44:42,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,153 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2024-10-11 01:44:42,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:44:42,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:44:42,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:44:42,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:44:42,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,191 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 1, 4]. [2024-10-11 01:44:42,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:44:42,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:44:42,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:44:42,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:44:42,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (1/1) ... [2024-10-11 01:44:42,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:44:42,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:42,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:44:42,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:44:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:44:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:44:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:44:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:44:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:44:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:44:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 01:44:42,311 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:44:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:44:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:44:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:44:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:44:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:44:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:44:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:44:42,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:44:42,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:44:42,465 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:44:42,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:44:42,668 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-11 01:44:42,668 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:44:42,722 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:44:42,723 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 01:44:42,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:42 BoogieIcfgContainer [2024-10-11 01:44:42,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:44:42,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:44:42,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:44:42,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:44:42,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:44:41" (1/3) ... [2024-10-11 01:44:42,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507f53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:42, skipping insertion in model container [2024-10-11 01:44:42,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:44:42" (2/3) ... [2024-10-11 01:44:42,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507f53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:44:42, skipping insertion in model container [2024-10-11 01:44:42,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:44:42" (3/3) ... [2024-10-11 01:44:42,736 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-10-11 01:44:42,755 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:44:42,755 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:44:42,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:44:42,810 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;@5c5997f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:44:42,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:44:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 01:44:42,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:42,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:42,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:42,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2095146488, now seen corresponding path program 1 times [2024-10-11 01:44:42,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:42,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282528834] [2024-10-11 01:44:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:42,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 01:44:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282528834] [2024-10-11 01:44:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282528834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:44:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696395707] [2024-10-11 01:44:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:43,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:44:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:43,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:44:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:44:43,154 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:43,259 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2024-10-11 01:44:43,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:44:43,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 01:44:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:43,281 INFO L225 Difference]: With dead ends: 36 [2024-10-11 01:44:43,285 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 01:44:43,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:44:43,300 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:43,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:43,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 01:44:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-11 01:44:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-10-11 01:44:43,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2024-10-11 01:44:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:43,338 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-10-11 01:44:43,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-10-11 01:44:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 01:44:43,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:43,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:44:43,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:43,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash -523038448, now seen corresponding path program 1 times [2024-10-11 01:44:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:43,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253922953] [2024-10-11 01:44:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 01:44:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253922953] [2024-10-11 01:44:43,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253922953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:43,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:43,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:44:43,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716323747] [2024-10-11 01:44:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:43,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:44:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:43,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:44:43,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:44:43,554 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:43,593 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2024-10-11 01:44:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:44:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 01:44:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:43,597 INFO L225 Difference]: With dead ends: 29 [2024-10-11 01:44:43,597 INFO L226 Difference]: Without dead ends: 18 [2024-10-11 01:44:43,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:44:43,599 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:43,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-11 01:44:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-11 01:44:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-10-11 01:44:43,616 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2024-10-11 01:44:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:43,616 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-10-11 01:44:43,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:44:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-10-11 01:44:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:44:43,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:43,618 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:43,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:44:43,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:43,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1472129899, now seen corresponding path program 1 times [2024-10-11 01:44:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:43,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016471059] [2024-10-11 01:44:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:43,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 01:44:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:43,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016471059] [2024-10-11 01:44:43,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016471059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291624625] [2024-10-11 01:44:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:43,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:43,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:43,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:44:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:43,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 01:44:43,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:44:44,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291624625] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:44,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-10-11 01:44:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89886055] [2024-10-11 01:44:44,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:44,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:44:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:44,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:44:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:44,071 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:44,124 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-10-11 01:44:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:44:44,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17 [2024-10-11 01:44:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:44,126 INFO L225 Difference]: With dead ends: 30 [2024-10-11 01:44:44,126 INFO L226 Difference]: Without dead ends: 19 [2024-10-11 01:44:44,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:44:44,128 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:44,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-11 01:44:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-11 01:44:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-11 01:44:44,137 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 17 [2024-10-11 01:44:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:44,138 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-11 01:44:44,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 01:44:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-11 01:44:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:44:44,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:44,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:44,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:44,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:44,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:44,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1900653178, now seen corresponding path program 2 times [2024-10-11 01:44:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:44,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019961529] [2024-10-11 01:44:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:45,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:45,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019961529] [2024-10-11 01:44:45,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019961529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:45,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:45,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 01:44:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249548850] [2024-10-11 01:44:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:45,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 01:44:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:45,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 01:44:45,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:44:45,138 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:45,256 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-11 01:44:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 01:44:45,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 01:44:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:45,258 INFO L225 Difference]: With dead ends: 23 [2024-10-11 01:44:45,259 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 01:44:45,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 01:44:45,260 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:45,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:44:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 01:44:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 01:44:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-11 01:44:45,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 23 [2024-10-11 01:44:45,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:45,271 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-11 01:44:45,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-10-11 01:44:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:44:45,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:45,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:45,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:44:45,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:45,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1900654852, now seen corresponding path program 1 times [2024-10-11 01:44:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:45,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433855156] [2024-10-11 01:44:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 01:44:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433855156] [2024-10-11 01:44:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433855156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:44:45,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:44:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 01:44:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101213700] [2024-10-11 01:44:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:44:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:44:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:45,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:44:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:44:45,573 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:45,624 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-11 01:44:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:44:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 01:44:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:45,626 INFO L225 Difference]: With dead ends: 24 [2024-10-11 01:44:45,629 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 01:44:45,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:44:45,630 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:45,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:44:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 01:44:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-11 01:44:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-11 01:44:45,638 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 23 [2024-10-11 01:44:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:45,639 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-11 01:44:45,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 01:44:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-11 01:44:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:44:45,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:45,640 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:45,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:44:45,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1166569407, now seen corresponding path program 1 times [2024-10-11 01:44:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340428290] [2024-10-11 01:44:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:46,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:46,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340428290] [2024-10-11 01:44:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340428290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719867515] [2024-10-11 01:44:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:46,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:46,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:46,993 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:46,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:44:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:47,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 01:44:47,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:47,242 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-10-11 01:44:47,258 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-10-11 01:44:47,335 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 23 treesize of output 11 [2024-10-11 01:44:47,440 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 11 treesize of output 3 [2024-10-11 01:44:47,450 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 3 [2024-10-11 01:44:47,638 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:44:47,638 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 20 treesize of output 23 [2024-10-11 01:44:47,672 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 01:44:47,672 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 15 treesize of output 15 [2024-10-11 01:44:47,779 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-10-11 01:44:47,787 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 35 treesize of output 23 [2024-10-11 01:44:47,795 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 20 treesize of output 15 [2024-10-11 01:44:47,803 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-10-11 01:44:47,864 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 27 treesize of output 15 [2024-10-11 01:44:47,874 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 7 treesize of output 3 [2024-10-11 01:44:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:47,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:48,113 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 208 treesize of output 178 [2024-10-11 01:44:48,122 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 314 treesize of output 254 [2024-10-11 01:44:48,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse4 (select .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse5 (select .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.offset|)) (.cse1 (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse11 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (let ((.cse0 (let ((.cse10 (forall ((v_ArrVal_550 (Array Int Int)) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_550) v_arrayElimCell_11) v_arrayElimCell_12))))) (and (forall ((v_ArrVal_550 (Array Int Int)) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_550))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 .cse4) .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_11) v_arrayElimCell_12))))) (or .cse1 .cse10) (or .cse3 .cse10)))) (.cse2 (forall ((v_ArrVal_550 (Array Int Int)) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse8 (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_550) v_arrayElimCell_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 v_arrayElimCell_12))))))) (and (or .cse0 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|)) (or .cse1 .cse2) (or .cse0 (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (or (not .cse3) (forall ((v_ArrVal_550 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_550) .cse4) .cse5))) (not .cse1)) (forall ((v_ArrVal_550 (Array Int Int)) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| v_ArrVal_550))) (let ((.cse6 (select .cse7 v_arrayElimCell_11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse7 .cse4) .cse5)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 v_arrayElimCell_12)))))) (or .cse3 .cse2))))) is different from false [2024-10-11 01:44:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719867515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:48,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:44:48,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2024-10-11 01:44:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733278788] [2024-10-11 01:44:48,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:48,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 01:44:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 01:44:48,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=913, Unknown=1, NotChecked=60, Total=1056 [2024-10-11 01:44:48,809 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 01:44:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:44:49,357 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-11 01:44:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 01:44:49,358 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2024-10-11 01:44:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:44:49,358 INFO L225 Difference]: With dead ends: 28 [2024-10-11 01:44:49,358 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:44:49,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=1367, Unknown=1, NotChecked=74, Total=1560 [2024-10-11 01:44:49,360 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:44:49,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:44:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:44:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 01:44:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:44:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-10-11 01:44:49,370 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 25 [2024-10-11 01:44:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:44:49,371 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-10-11 01:44:49,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 01:44:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-10-11 01:44:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:44:49,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:44:49,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:44:49,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 01:44:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:49,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:44:49,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:44:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1166571081, now seen corresponding path program 1 times [2024-10-11 01:44:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:44:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663513095] [2024-10-11 01:44:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:44:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:49,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:44:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:44:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:44:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 01:44:50,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:44:50,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663513095] [2024-10-11 01:44:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663513095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:44:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742343769] [2024-10-11 01:44:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:44:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:44:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:44:50,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:44:50,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:44:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:44:50,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 01:44:50,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:44:50,320 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 26 treesize of output 18 [2024-10-11 01:44:50,326 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-10-11 01:44:50,345 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 20 treesize of output 8 [2024-10-11 01:44:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:44:50,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:44:50,361 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 108 treesize of output 78 [2024-10-11 01:44:50,364 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 26 treesize of output 22 [2024-10-11 01:44:50,372 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 25 treesize of output 21 [2024-10-11 01:44:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 01:44:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742343769] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:44:50,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:44:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 16 [2024-10-11 01:44:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027906274] [2024-10-11 01:44:50,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:44:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 01:44:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:44:50,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 01:44:50,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-11 01:44:50,417 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:44:54,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:44:58,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:02,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:06,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:10,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:14,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 01:45:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:14,625 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-11 01:45:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:45:14,626 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2024-10-11 01:45:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:14,626 INFO L225 Difference]: With dead ends: 29 [2024-10-11 01:45:14,626 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 01:45:14,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-11 01:45:14,627 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:14,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-10-11 01:45:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 01:45:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 01:45:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-10-11 01:45:14,635 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2024-10-11 01:45:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-10-11 01:45:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 01:45:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-10-11 01:45:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:45:14,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:14,636 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:14,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 01:45:14,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:14,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -86702020, now seen corresponding path program 2 times [2024-10-11 01:45:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970845505] [2024-10-11 01:45:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:45:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:16,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:45:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:45:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:45:16,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970845505] [2024-10-11 01:45:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970845505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205970829] [2024-10-11 01:45:16,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:45:16,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:16,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:16,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:45:16,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:45:16,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:45:16,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-10-11 01:45:16,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:16,846 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-10-11 01:45:16,856 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-10-11 01:45:16,926 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 23 treesize of output 11 [2024-10-11 01:45:17,135 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:45:17,135 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-10-11 01:45:17,164 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:45:17,165 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-10-11 01:45:17,240 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 20 treesize of output 15 [2024-10-11 01:45:17,252 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-10-11 01:45:17,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:45:17,448 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 45 treesize of output 21 [2024-10-11 01:45:17,454 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 7 [2024-10-11 01:45:17,459 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 11 treesize of output 3 [2024-10-11 01:45:17,468 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 7 treesize of output 3 [2024-10-11 01:45:17,699 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:45:17,699 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 20 treesize of output 23 [2024-10-11 01:45:17,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:17,715 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 53 treesize of output 36 [2024-10-11 01:45:17,737 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-10-11 01:45:17,737 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 24 treesize of output 31 [2024-10-11 01:45:17,775 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:45:17,775 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 28 treesize of output 30 [2024-10-11 01:45:17,901 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 59 treesize of output 42 [2024-10-11 01:45:17,908 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 74 treesize of output 46 [2024-10-11 01:45:17,915 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 24 treesize of output 19 [2024-10-11 01:45:17,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:17,921 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 23 treesize of output 22 [2024-10-11 01:45:18,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:45:18,181 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 77 treesize of output 40 [2024-10-11 01:45:18,192 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:45:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:45:18,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:18,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:18,917 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 294 treesize of output 276 [2024-10-11 01:45:18,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:18,925 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 266 treesize of output 248 [2024-10-11 01:45:18,961 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_arrayElimArr_2)) (.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_arrayElimArr_1)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (+ .cse2 4))) (let ((.cse0 (store |c_#memory_int#2| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25| v_ArrVal_906)) (.cse4 (select (select .cse7 .cse1) .cse10)) (.cse5 (select (select .cse9 .cse1) .cse10))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_25|) 0)) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse1) .cse2))) (not (= (select .cse3 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_1 4))) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse0 .cse4) .cse5))) (not (= (select .cse6 |c_ULTIMATE.start_sll_prepend_~head#1.offset|) (select v_arrayElimArr_2 4))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse8 (+ 4 .cse5))) (select (select .cse0 (select (select .cse7 .cse4) .cse8)) (select (select .cse9 .cse4) .cse8)))))))))) is different from false [2024-10-11 01:45:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205970829] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:18,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:45:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2024-10-11 01:45:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043142147] [2024-10-11 01:45:18,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 01:45:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 01:45:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2038, Unknown=2, NotChecked=90, Total=2256 [2024-10-11 01:45:18,966 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:45:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:20,021 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-11 01:45:20,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 01:45:20,021 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2024-10-11 01:45:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:20,023 INFO L225 Difference]: With dead ends: 32 [2024-10-11 01:45:20,023 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 01:45:20,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=215, Invalid=3093, Unknown=2, NotChecked=112, Total=3422 [2024-10-11 01:45:20,025 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:20,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 209 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 01:45:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 01:45:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-11 01:45:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-11 01:45:20,034 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2024-10-11 01:45:20,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:20,034 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-11 01:45:20,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:45:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-11 01:45:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:45:20,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:20,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:20,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:45:20,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 01:45:20,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:20,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash -86703694, now seen corresponding path program 2 times [2024-10-11 01:45:20,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:20,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979231989] [2024-10-11 01:45:20,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:20,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:21,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:45:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:45:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:21,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:45:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:45:21,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979231989] [2024-10-11 01:45:21,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979231989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:21,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312384508] [2024-10-11 01:45:21,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:45:21,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:21,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:21,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:45:21,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:45:21,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:45:21,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 01:45:21,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:21,625 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-10-11 01:45:21,673 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-10-11 01:45:21,747 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 3 [2024-10-11 01:45:21,749 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 12 treesize of output 4 [2024-10-11 01:45:21,887 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:45:21,887 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 21 treesize of output 24 [2024-10-11 01:45:21,904 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 01:45:21,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 15 treesize of output 15 [2024-10-11 01:45:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 01:45:21,986 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 28 treesize of output 27 [2024-10-11 01:45:21,990 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 32 treesize of output 20 [2024-10-11 01:45:22,034 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 7 treesize of output 3 [2024-10-11 01:45:22,133 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 01:45:22,134 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 32 treesize of output 15 [2024-10-11 01:45:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:45:22,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:45:22,221 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 236 treesize of output 206 [2024-10-11 01:45:22,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:22,397 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 176 treesize of output 159 [2024-10-11 01:45:22,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312384508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:22,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:45:22,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 33 [2024-10-11 01:45:22,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616812124] [2024-10-11 01:45:22,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:45:22,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 01:45:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:45:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 01:45:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1303, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 01:45:22,637 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:45:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:45:23,287 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-10-11 01:45:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 01:45:23,288 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2024-10-11 01:45:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:45:23,290 INFO L225 Difference]: With dead ends: 32 [2024-10-11 01:45:23,290 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 01:45:23,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 01:45:23,291 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 01:45:23,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 253 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 01:45:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 01:45:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-11 01:45:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:45:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-11 01:45:23,297 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 27 [2024-10-11 01:45:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:45:23,298 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-11 01:45:23,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 25 states have internal predecessors, (36), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 01:45:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-11 01:45:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:45:23,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:45:23,299 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:45:23,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 01:45:23,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:23,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:45:23,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:45:23,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1716228745, now seen corresponding path program 3 times [2024-10-11 01:45:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:45:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439855769] [2024-10-11 01:45:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:45:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:45:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:45:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:45:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:45:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:45:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:45:25,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:45:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439855769] [2024-10-11 01:45:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439855769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:45:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358309026] [2024-10-11 01:45:25,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:45:25,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:45:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:45:25,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:45:25,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:45:25,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 01:45:25,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:45:25,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-10-11 01:45:25,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:45:25,604 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-10-11 01:45:25,626 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-10-11 01:45:25,631 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-10-11 01:45:29,782 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-10-11 01:45:29,786 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (or (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#2.offset|))) (and (= 0 (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|)))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2)) |c_#memory_$Pointer$#2.base|) (= .cse2 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_6| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-10-11 01:45:29,832 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-11 01:45:29,832 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 23 treesize of output 22 [2024-10-11 01:45:29,850 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-10-11 01:45:29,851 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 27 treesize of output 23 [2024-10-11 01:45:33,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_78| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_78|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_78| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |v_#memory_$Pointer$#2.offset_78| .cse2)))))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_78| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_78| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-10-11 01:45:33,881 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (or (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0)) (exists ((|v_#memory_$Pointer$#2.offset_78| (Array Int (Array Int Int)))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| |v_#memory_$Pointer$#2.offset_78|))) (and (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse0) 4) 0) (= .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= |v_#memory_$Pointer$#2.offset_78| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_4| .cse2 (select |v_#memory_$Pointer$#2.offset_78| .cse2)))))) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_78| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$#2.offset_78| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4 0)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-10-11 01:45:33,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-10-11 01:45:33,923 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (or (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-10-11 01:45:33,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-10-11 01:45:33,954 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_10| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_10| .cse1) 1) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (store |v_#valid_BEFORE_CALL_10| .cse2 (select |c_#valid| .cse2)))))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (or (= .cse1 .cse0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-10-11 01:45:33,969 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 01:45:33,969 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 60 treesize of output 27 [2024-10-11 01:45:33,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:33,975 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 19 treesize of output 7 [2024-10-11 01:45:33,993 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:45:33,994 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (v_arrayElimIndex_3 Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:45:34,018 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:45:34,020 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:45:34,052 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-10-11 01:45:34,054 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-10-11 01:45:34,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:34,110 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 01:45:34,110 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 68 treesize of output 51 [2024-10-11 01:45:34,160 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-10-11 01:45:34,160 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-10-11 01:45:34,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse5 (= (select .cse7 4) 0)) (.cse4 (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse6 (= (select .cse8 4) 0))) (or (and (or .cse4 .cse5) (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (and .cse6 .cse5) (and (or .cse4 (= .cse7 .cse8)) .cse6)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse9 (select |v_old(#valid)_AFTER_CALL_17| .cse9))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2024-10-11 01:45:34,217 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_#valid_BEFORE_CALL_11| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= |v_#valid_BEFORE_CALL_11| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_#valid_BEFORE_CALL_11|))) (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_#valid_BEFORE_CALL_11| .cse0)))) (= 0 (select |v_#valid_BEFORE_CALL_10| .cse1)) (= (select |v_#valid_BEFORE_CALL_10| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_11| .cse1) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_prepend_~head#1.offset_BEFORE_CALL_6|) 0)))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= .cse2 .cse3) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0)) (let ((.cse8 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse5 (= (select .cse7 4) 0)) (.cse4 (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (.cse6 (= (select .cse8 4) 0))) (or (and (or .cse4 .cse5) (= .cse3 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (and .cse6 .cse5) (and (or .cse4 (= .cse7 .cse8)) .cse6)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse9 (select |v_old(#valid)_AFTER_CALL_17| .cse9))) |v_old(#valid)_AFTER_CALL_17|) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2024-10-11 01:45:34,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:45:34,339 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 202 treesize of output 142 [2024-10-11 01:45:34,349 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 01:45:34,349 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 15 treesize of output 7 [2024-10-11 01:45:34,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:34,366 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-10-11 01:45:34,366 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 166 treesize of output 104 [2024-10-11 01:45:34,421 INFO L349 Elim1Store]: treesize reduction 62, result has 56.0 percent of original size [2024-10-11 01:45:34,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 145 [2024-10-11 01:45:34,431 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 8 treesize of output 7 [2024-10-11 01:45:34,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:34,509 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 8 treesize of output 1 [2024-10-11 01:45:34,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:45:34,515 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 8 treesize of output 1 [2024-10-11 01:45:34,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (= (select .cse2 4) 0) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (or (= .cse4 (store .cse2 4 0)) (= (select .cse4 4) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))) is different from false [2024-10-11 01:45:34,537 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#2.base| .cse0) 4) 0) (= .cse1 .cse0)) (= (select .cse2 4) 0) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse3 (select |v_old(#valid)_AFTER_CALL_17| .cse3))) |v_old(#valid)_AFTER_CALL_17|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (or (= .cse4 (store .cse2 4 0)) (= (select .cse4 4) 0))) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))) is different from true [2024-10-11 01:45:34,682 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_17| .cse0))) |v_old(#valid)_AFTER_CALL_17|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse3 4)) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse4 4) 0) (= (store .cse4 4 0) .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse5) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from false [2024-10-11 01:45:34,685 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse0 (select |v_old(#valid)_AFTER_CALL_17| .cse0))) |v_old(#valid)_AFTER_CALL_17|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse1) 4))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse1) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse3 4)) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= (select .cse4 4) 0) (= (store .cse4 4 0) .cse3)))))))) (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse5) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| .cse5) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse5) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse6) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0))) is different from true [2024-10-11 01:45:34,773 WARN L851 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse5)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select .cse4 4)) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 4) 0) (= (store .cse6 4 0) .cse4)))))) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|)))) is different from false [2024-10-11 01:45:34,776 WARN L873 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0)))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse3) 4))) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse5)) (.cse4 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select .cse4 4)) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse5) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse3) 4) 0) (= (select .cse6 4) 0) (= (store .cse6 4 0) .cse4)))))) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|)))) is different from true [2024-10-11 01:45:34,880 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|)) (.cse4 (select .cse5 4))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| .cse4)) (.cse8 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse6 (+ (select .cse10 4) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| (select .cse5 .cse6)) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|) (= (select .cse8 4) 0) (= (select .cse9 4) 0) (= (store .cse9 4 0) .cse10) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse8 .cse6))))))))) is different from false [2024-10-11 01:45:34,883 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= .cse1 |c_ULTIMATE.start_main_~temp~2#1.base|) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0))))) (= |c_ULTIMATE.start_main_~temp~2#1.offset| 0)) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse10 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|)) (.cse4 (select .cse5 4))) (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| .cse4)) (.cse8 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse6 (+ (select .cse10 4) 4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= |c_ULTIMATE.start_main_~temp~2#1.base| (select .cse5 .cse6)) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse7 (select |v_old(#valid)_AFTER_CALL_17| .cse7))) |v_old(#valid)_AFTER_CALL_17|) (= (select .cse8 4) 0) (= (select .cse9 4) 0) (= (store .cse9 4 0) .cse10) (= |c_ULTIMATE.start_main_~temp~2#1.offset| (select .cse8 .cse6))))))))) is different from true [2024-10-11 01:45:34,960 WARN L851 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse5 4)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|))) (let ((.cse6 (+ (select .cse10 4) 4)) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse9 (select |c_#memory_$Pointer$#2.offset| .cse4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select .cse7 .cse6)) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|) (= (select .cse7 4) 0) (= (select .cse9 4) 0) (= (store .cse9 4 0) .cse10)))))))) is different from false [2024-10-11 01:45:34,963 WARN L873 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 4))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4) 0) (= (select |v_old(#valid)_AFTER_CALL_17| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse0) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse2 (select |v_old(#valid)_AFTER_CALL_17| .cse2))) |v_old(#valid)_AFTER_CALL_17|) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 4) 0) (= .cse1 |c_ULTIMATE.start_main_~ptr~0#1.base|)))))) (exists ((|v_#valid_BEFORE_CALL_13| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_17| (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.base_34| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse3))) (let ((.cse4 (select .cse5 4)) (.cse10 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_34|))) (let ((.cse6 (+ (select .cse10 4) 4)) (.cse7 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse9 (select |c_#memory_$Pointer$#2.offset| .cse4))) (and (= (select |v_old(#valid)_AFTER_CALL_17| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_17| |v_ULTIMATE.start_main_~ptr~0#1.base_34|) 0) (= (select (select |c_#memory_$Pointer$#2.base| .cse4) 4) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select .cse5 .cse6)) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select .cse7 .cse6)) (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_13| |v_old(#valid)_AFTER_CALL_17|))) (store |v_#valid_BEFORE_CALL_13| .cse8 (select |v_old(#valid)_AFTER_CALL_17| .cse8))) |v_old(#valid)_AFTER_CALL_17|) (= (select .cse7 4) 0) (= (select .cse9 4) 0) (= (store .cse9 4 0) .cse10)))))))) is different from true [2024-10-11 01:45:35,194 INFO L349 Elim1Store]: treesize reduction 160, result has 46.8 percent of original size [2024-10-11 01:45:35,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 264 treesize of output 296 [2024-10-11 01:45:35,398 INFO L349 Elim1Store]: treesize reduction 56, result has 66.9 percent of original size [2024-10-11 01:45:35,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 162 treesize of output 252