./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 19:02:25,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 19:02:25,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 19:02:25,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 19:02:25,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 19:02:25,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 19:02:25,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 19:02:25,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 19:02:25,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 19:02:25,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 19:02:25,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 19:02:25,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 19:02:25,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 19:02:25,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 19:02:25,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 19:02:25,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 19:02:25,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 19:02:25,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 19:02:25,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 19:02:25,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 19:02:25,638 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 19:02:25,641 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 19:02:25,641 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 19:02:25,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 19:02:25,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 19:02:25,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 19:02:25,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 19:02:25,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 19:02:25,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 19:02:25,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 19:02:25,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 19:02:25,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 19:02:25,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 19:02:25,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:02:25,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 19:02:25,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 19:02:25,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 19:02:25,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 19:02:25,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 19:02:25,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 19:02:25,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 19:02:25,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 19:02:25,644 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2024-11-22 19:02:25,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 19:02:25,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 19:02:25,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 19:02:25,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 19:02:25,864 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 19:02:25,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-22 19:02:27,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 19:02:27,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 19:02:27,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2024-11-22 19:02:27,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d8d8913/bbd18b719ddf4076a4883e84febf6382/FLAG345f874e8 [2024-11-22 19:02:27,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d8d8913/bbd18b719ddf4076a4883e84febf6382 [2024-11-22 19:02:27,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 19:02:27,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 19:02:27,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 19:02:27,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 19:02:27,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 19:02:27,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663cc63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27, skipping insertion in model container [2024-11-22 19:02:27,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 19:02:27,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:02:27,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 19:02:27,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:02:27,927 INFO L204 MainTranslator]: Completed translation [2024-11-22 19:02:27,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27 WrapperNode [2024-11-22 19:02:27,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 19:02:27,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 19:02:27,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 19:02:27,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 19:02:27,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,968 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 156 [2024-11-22 19:02:27,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 19:02:27,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 19:02:27,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 19:02:27,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 19:02:27,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,992 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-22 19:02:27,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:27,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:28,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:28,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:28,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:28,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:28,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 19:02:28,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 19:02:28,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 19:02:28,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 19:02:28,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (1/1) ... [2024-11-22 19:02:28,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:02:28,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:28,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 19:02:28,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 19:02:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 19:02:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 19:02:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 19:02:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 19:02:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 19:02:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 19:02:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-22 19:02:28,082 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-22 19:02:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 19:02:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 19:02:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 19:02:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 19:02:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 19:02:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 19:02:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 19:02:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 19:02:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 19:02:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 19:02:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 19:02:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 19:02:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 19:02:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 19:02:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 19:02:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 19:02:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 19:02:28,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 19:02:28,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 19:02:28,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 19:02:28,517 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-22 19:02:28,517 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 19:02:28,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 19:02:28,531 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-22 19:02:28,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:02:28 BoogieIcfgContainer [2024-11-22 19:02:28,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 19:02:28,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 19:02:28,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 19:02:28,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 19:02:28,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:02:27" (1/3) ... [2024-11-22 19:02:28,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a60496d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:02:28, skipping insertion in model container [2024-11-22 19:02:28,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:27" (2/3) ... [2024-11-22 19:02:28,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a60496d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:02:28, skipping insertion in model container [2024-11-22 19:02:28,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:02:28" (3/3) ... [2024-11-22 19:02:28,537 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2024-11-22 19:02:28,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 19:02:28,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-22 19:02:28,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 19:02:28,595 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=None, 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;@7e84ef4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 19:02:28,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-22 19:02:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 98 states have internal predecessors, (115), 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-11-22 19:02:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 19:02:28,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:28,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:28,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:28,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1815197689, now seen corresponding path program 1 times [2024-11-22 19:02:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824960544] [2024-11-22 19:02:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:02:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824960544] [2024-11-22 19:02:28,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824960544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:28,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:28,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:02:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432867296] [2024-11-22 19:02:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:28,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:02:28,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:02:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:28,875 INFO L87 Difference]: Start difference. First operand has 102 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 98 states have internal predecessors, (115), 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, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:02:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:28,972 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-22 19:02:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:02:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 19:02:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:28,981 INFO L225 Difference]: With dead ends: 99 [2024-11-22 19:02:28,981 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 19:02:28,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:28,987 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:28,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:02:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 19:02:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 19:02:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 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-11-22 19:02:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-22 19:02:29,024 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 7 [2024-11-22 19:02:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:29,025 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-22 19:02:29,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:02:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-22 19:02:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 19:02:29,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:29,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:29,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 19:02:29,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:29,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1815197690, now seen corresponding path program 1 times [2024-11-22 19:02:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:29,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929552160] [2024-11-22 19:02:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:02:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929552160] [2024-11-22 19:02:29,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929552160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:29,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:29,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:02:29,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993419807] [2024-11-22 19:02:29,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:29,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:02:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:29,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:02:29,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:29,124 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:02:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:29,190 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-11-22 19:02:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:02:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 19:02:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:29,192 INFO L225 Difference]: With dead ends: 94 [2024-11-22 19:02:29,192 INFO L226 Difference]: Without dead ends: 94 [2024-11-22 19:02:29,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:29,193 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:29,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:02:29,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-22 19:02:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-22 19:02:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 90 states have internal predecessors, (99), 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-11-22 19:02:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2024-11-22 19:02:29,206 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 7 [2024-11-22 19:02:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:29,206 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2024-11-22 19:02:29,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:02:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2024-11-22 19:02:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 19:02:29,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:29,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:29,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 19:02:29,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:29,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -553922496, now seen corresponding path program 1 times [2024-11-22 19:02:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708188381] [2024-11-22 19:02:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:02:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708188381] [2024-11-22 19:02:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708188381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:02:29,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298274728] [2024-11-22 19:02:29,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:29,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 19:02:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:29,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 19:02:29,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:29,334 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-22 19:02:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:29,462 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-22 19:02:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 19:02:29,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-22 19:02:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:29,463 INFO L225 Difference]: With dead ends: 93 [2024-11-22 19:02:29,465 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 19:02:29,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:29,466 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:29,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:02:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 19:02:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 19:02:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.75) internal successors, (98), 89 states have internal predecessors, (98), 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-11-22 19:02:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-11-22 19:02:29,476 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 13 [2024-11-22 19:02:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:29,477 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-11-22 19:02:29,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-22 19:02:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-11-22 19:02:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 19:02:29,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:29,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:29,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 19:02:29,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:29,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -553922495, now seen corresponding path program 1 times [2024-11-22 19:02:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:29,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920371527] [2024-11-22 19:02:29,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:02:29,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920371527] [2024-11-22 19:02:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920371527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:29,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:29,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:02:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416704294] [2024-11-22 19:02:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:29,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 19:02:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:29,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 19:02:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:29,652 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-22 19:02:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:29,769 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-22 19:02:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 19:02:29,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-22 19:02:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:29,771 INFO L225 Difference]: With dead ends: 92 [2024-11-22 19:02:29,771 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 19:02:29,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:29,772 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:29,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:02:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 19:02:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 19:02:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.7321428571428572) internal successors, (97), 88 states have internal predecessors, (97), 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-11-22 19:02:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-11-22 19:02:29,781 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 13 [2024-11-22 19:02:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-22 19:02:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-11-22 19:02:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-22 19:02:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 19:02:29,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:29,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:29,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 19:02:29,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:29,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1116124864, now seen corresponding path program 1 times [2024-11-22 19:02:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037954813] [2024-11-22 19:02:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:29,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:02:29,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:29,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037954813] [2024-11-22 19:02:29,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037954813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:02:29,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685849014] [2024-11-22 19:02:29,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:29,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:02:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:02:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:29,827 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-22 19:02:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:29,834 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-11-22 19:02:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:02:29,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-22 19:02:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:29,836 INFO L225 Difference]: With dead ends: 98 [2024-11-22 19:02:29,836 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 19:02:29,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:29,837 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:29,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 19:02:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-22 19:02:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.719298245614035) internal successors, (98), 89 states have internal predecessors, (98), 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-11-22 19:02:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-11-22 19:02:29,845 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 15 [2024-11-22 19:02:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:29,846 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-11-22 19:02:29,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-22 19:02:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-11-22 19:02:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 19:02:29,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:29,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:29,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 19:02:29,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:29,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1974832318, now seen corresponding path program 1 times [2024-11-22 19:02:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170669993] [2024-11-22 19:02:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:02:29,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170669993] [2024-11-22 19:02:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170669993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132814853] [2024-11-22 19:02:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:29,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:29,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:29,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:29,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 19:02:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:30,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 19:02:30,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:02:30,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:02:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 19:02:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132814853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:02:30,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:02:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-22 19:02:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723338497] [2024-11-22 19:02:30,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:02:30,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:02:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:30,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:02:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:02:30,117 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 19:02:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:30,130 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-22 19:02:30,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 19:02:30,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-22 19:02:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:30,131 INFO L225 Difference]: With dead ends: 99 [2024-11-22 19:02:30,132 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 19:02:30,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:02:30,133 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:30,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 286 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 19:02:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-22 19:02:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 94 states have internal predecessors, (103), 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-11-22 19:02:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2024-11-22 19:02:30,137 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 28 [2024-11-22 19:02:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:30,138 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2024-11-22 19:02:30,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-22 19:02:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2024-11-22 19:02:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 19:02:30,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:30,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:30,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 19:02:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 19:02:30,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:30,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1500032, now seen corresponding path program 2 times [2024-11-22 19:02:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333133360] [2024-11-22 19:02:30,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:02:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:30,379 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:02:30,381 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:02:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 19:02:30,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333133360] [2024-11-22 19:02:30,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333133360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231969831] [2024-11-22 19:02:30,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 19:02:30,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:30,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:30,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:30,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 19:02:30,866 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 19:02:30,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 19:02:30,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 19:02:30,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:30,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:02:30,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 19:02:30,922 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-22 19:02:30,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:02:30,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 19:02:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 19:02:31,062 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:02:31,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 19:02:31,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 19:02:31,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:02:31,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 19:02:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2024-11-22 19:02:31,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:02:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231969831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:31,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:02:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-11-22 19:02:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261962522] [2024-11-22 19:02:31,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:02:31,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 19:02:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 19:02:31,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-11-22 19:02:31,256 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 19:02:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:31,574 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-22 19:02:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 19:02:31,574 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-11-22 19:02:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:31,575 INFO L225 Difference]: With dead ends: 111 [2024-11-22 19:02:31,575 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 19:02:31,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=346, Unknown=1, NotChecked=38, Total=462 [2024-11-22 19:02:31,576 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 111 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:31,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 422 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 406 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2024-11-22 19:02:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 19:02:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2024-11-22 19:02:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.596774193548387) internal successors, (99), 90 states have internal predecessors, (99), 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-11-22 19:02:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-11-22 19:02:31,582 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 41 [2024-11-22 19:02:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:31,583 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-11-22 19:02:31,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 19:02:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-11-22 19:02:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 19:02:31,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:31,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:31,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 19:02:31,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-22 19:02:31,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:31,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1500031, now seen corresponding path program 1 times [2024-11-22 19:02:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:31,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975124548] [2024-11-22 19:02:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 19:02:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975124548] [2024-11-22 19:02:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975124548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241328060] [2024-11-22 19:02:32,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:32,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:32,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 19:02:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:32,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 19:02:32,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:32,325 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 1 [2024-11-22 19:02:32,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 19:02:32,343 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-22 19:02:32,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:02:32,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 19:02:32,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 19:02:32,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:02:32,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 19:02:32,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-22 19:02:32,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:02:32,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 19:02:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 19:02:32,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 19:02:32,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241328060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:32,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 19:02:32,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2024-11-22 19:02:32,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087788653] [2024-11-22 19:02:32,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:32,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 19:02:32,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:32,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 19:02:32,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2024-11-22 19:02:32,544 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-11-22 19:02:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:32,643 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2024-11-22 19:02:32,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 19:02:32,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 41 [2024-11-22 19:02:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:32,644 INFO L225 Difference]: With dead ends: 97 [2024-11-22 19:02:32,644 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 19:02:32,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-11-22 19:02:32,645 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:32,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 278 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 123 Unchecked, 0.1s Time] [2024-11-22 19:02:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 19:02:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-11-22 19:02:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.564516129032258) internal successors, (97), 88 states have internal predecessors, (97), 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-11-22 19:02:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-22 19:02:32,648 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 41 [2024-11-22 19:02:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:32,649 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-22 19:02:32,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-11-22 19:02:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-22 19:02:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 19:02:32,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:32,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:32,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 19:02:32,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:32,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1737780063, now seen corresponding path program 1 times [2024-11-22 19:02:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231305590] [2024-11-22 19:02:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 19:02:33,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231305590] [2024-11-22 19:02:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231305590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928574050] [2024-11-22 19:02:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:33,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:33,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:33,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:33,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 19:02:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:33,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 19:02:33,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:33,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:02:33,392 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-11-22 19:02:33,397 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-22 19:02:33,422 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-22 19:02:33,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 19:02:33,459 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 17 treesize of output 9 [2024-11-22 19:02:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-11-22 19:02:33,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:02:33,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-22 19:02:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:02:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928574050] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:02:33,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:02:33,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 22 [2024-11-22 19:02:33,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613912793] [2024-11-22 19:02:33,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:02:33,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 19:02:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 19:02:33,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=405, Unknown=1, NotChecked=40, Total=506 [2024-11-22 19:02:33,616 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 20 states have internal predecessors, (65), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 19:02:34,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:34,039 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2024-11-22 19:02:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 19:02:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 20 states have internal predecessors, (65), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2024-11-22 19:02:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:34,040 INFO L225 Difference]: With dead ends: 110 [2024-11-22 19:02:34,040 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 19:02:34,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=712, Unknown=1, NotChecked=54, Total=870 [2024-11-22 19:02:34,041 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 148 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:34,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 789 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 777 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2024-11-22 19:02:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 19:02:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-22 19:02:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.578125) internal successors, (101), 90 states have internal predecessors, (101), 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-11-22 19:02:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-22 19:02:34,044 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 44 [2024-11-22 19:02:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:34,044 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-22 19:02:34,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 20 states have internal predecessors, (65), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 19:02:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-22 19:02:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 19:02:34,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:34,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:34,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 19:02:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:34,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1737780062, now seen corresponding path program 1 times [2024-11-22 19:02:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551685139] [2024-11-22 19:02:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:02:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551685139] [2024-11-22 19:02:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551685139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596339119] [2024-11-22 19:02:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:34,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:34,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:34,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:34,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 19:02:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:34,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-22 19:02:34,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:34,852 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 1 [2024-11-22 19:02:35,083 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-11-22 19:02:35,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 19:02:35,117 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-11-22 19:02:35,159 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 19:02:35,160 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-11-22 19:02:35,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-22 19:02:35,203 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 17 treesize of output 9 [2024-11-22 19:02:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-11-22 19:02:35,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:02:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596339119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:35,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:02:35,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-11-22 19:02:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297223498] [2024-11-22 19:02:35,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:02:35,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 19:02:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:35,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 19:02:35,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=849, Unknown=1, NotChecked=58, Total=992 [2024-11-22 19:02:35,399 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 28 states, 26 states have (on average 2.576923076923077) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:02:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:36,190 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2024-11-22 19:02:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 19:02:36,190 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.576923076923077) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2024-11-22 19:02:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:36,192 INFO L225 Difference]: With dead ends: 117 [2024-11-22 19:02:36,192 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 19:02:36,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1974, Unknown=1, NotChecked=90, Total=2256 [2024-11-22 19:02:36,193 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 145 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:36,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 933 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 927 Invalid, 0 Unknown, 119 Unchecked, 0.4s Time] [2024-11-22 19:02:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 19:02:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2024-11-22 19:02:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 96 states have internal predecessors, (106), 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-11-22 19:02:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-22 19:02:36,199 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 44 [2024-11-22 19:02:36,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:36,200 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-22 19:02:36,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.576923076923077) internal successors, (67), 24 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:02:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-22 19:02:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 19:02:36,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:36,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:36,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 19:02:36,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 19:02:36,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:36,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1963391272, now seen corresponding path program 1 times [2024-11-22 19:02:36,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:36,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295362424] [2024-11-22 19:02:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 19:02:36,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:36,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295362424] [2024-11-22 19:02:36,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295362424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:36,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:36,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:02:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39448738] [2024-11-22 19:02:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:36,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:02:36,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:36,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:02:36,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:36,443 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:36,452 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-11-22 19:02:36,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:02:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-22 19:02:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:36,454 INFO L225 Difference]: With dead ends: 103 [2024-11-22 19:02:36,454 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 19:02:36,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:02:36,455 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:36,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 19:02:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-22 19:02:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 97 states have internal predecessors, (107), 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-11-22 19:02:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-22 19:02:36,459 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 45 [2024-11-22 19:02:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:36,459 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-22 19:02:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-22 19:02:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 19:02:36,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:36,460 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 19:02:36,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 735592277, now seen corresponding path program 1 times [2024-11-22 19:02:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807617774] [2024-11-22 19:02:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-22 19:02:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807617774] [2024-11-22 19:02:36,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807617774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:36,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:36,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:02:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664860025] [2024-11-22 19:02:36,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:36,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 19:02:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:36,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 19:02:36,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:36,552 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:36,629 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2024-11-22 19:02:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 19:02:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-22 19:02:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:36,630 INFO L225 Difference]: With dead ends: 102 [2024-11-22 19:02:36,630 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 19:02:36,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:36,631 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:36,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 288 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:02:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 19:02:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-22 19:02:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 96 states have internal predecessors, (106), 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-11-22 19:02:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-22 19:02:36,634 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 46 [2024-11-22 19:02:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:36,634 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-22 19:02:36,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-22 19:02:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 19:02:36,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:36,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:36,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 19:02:36,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:36,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:36,635 INFO L85 PathProgramCache]: Analyzing trace with hash 735592278, now seen corresponding path program 1 times [2024-11-22 19:02:36,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:36,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626210433] [2024-11-22 19:02:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:36,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 19:02:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626210433] [2024-11-22 19:02:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626210433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252921191] [2024-11-22 19:02:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:36,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:36,750 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:36,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 19:02:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:36,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 19:02:36,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 19:02:36,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 19:02:36,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252921191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:36,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 19:02:36,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-22 19:02:36,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057517469] [2024-11-22 19:02:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:36,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 19:02:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 19:02:36,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:02:36,896 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-22 19:02:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:36,914 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2024-11-22 19:02:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 19:02:36,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) Word has length 46 [2024-11-22 19:02:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:36,915 INFO L225 Difference]: With dead ends: 105 [2024-11-22 19:02:36,915 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 19:02:36,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:36,915 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 61 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:36,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 198 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 19:02:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2024-11-22 19:02:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 95 states have internal predecessors, (104), 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-11-22 19:02:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-22 19:02:36,919 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2024-11-22 19:02:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:36,919 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-22 19:02:36,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-22 19:02:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-22 19:02:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-22 19:02:36,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:36,922 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:36,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 19:02:37,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:37,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:37,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1329941933, now seen corresponding path program 1 times [2024-11-22 19:02:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:37,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021093853] [2024-11-22 19:02:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:37,260 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 19:02:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:37,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021093853] [2024-11-22 19:02:37,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021093853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:37,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:37,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:02:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190495688] [2024-11-22 19:02:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:37,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 19:02:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:37,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 19:02:37,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 19:02:37,262 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-22 19:02:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:37,283 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2024-11-22 19:02:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 19:02:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) Word has length 47 [2024-11-22 19:02:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:37,284 INFO L225 Difference]: With dead ends: 102 [2024-11-22 19:02:37,284 INFO L226 Difference]: Without dead ends: 102 [2024-11-22 19:02:37,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:02:37,285 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 54 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:37,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 199 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-22 19:02:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-22 19:02:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 92 states have internal predecessors, (100), 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-11-22 19:02:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-22 19:02:37,289 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 47 [2024-11-22 19:02:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:37,290 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-22 19:02:37,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-22 19:02:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-22 19:02:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 19:02:37,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:37,292 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:37,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 19:02:37,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:37,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:37,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1721474660, now seen corresponding path program 1 times [2024-11-22 19:02:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:37,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078750571] [2024-11-22 19:02:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 19:02:37,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078750571] [2024-11-22 19:02:37,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078750571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:37,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:37,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:02:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866892077] [2024-11-22 19:02:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:37,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 19:02:37,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:37,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 19:02:37,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 19:02:37,360 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:37,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:37,412 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-22 19:02:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 19:02:37,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-22 19:02:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:37,413 INFO L225 Difference]: With dead ends: 97 [2024-11-22 19:02:37,413 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 19:02:37,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-22 19:02:37,414 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:37,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 19:02:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-22 19:02:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.434782608695652) internal successors, (99), 91 states have internal predecessors, (99), 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-11-22 19:02:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-22 19:02:37,416 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 48 [2024-11-22 19:02:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:37,418 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-22 19:02:37,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-22 19:02:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 19:02:37,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:37,418 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:37,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 19:02:37,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:37,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1721474659, now seen corresponding path program 1 times [2024-11-22 19:02:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175341235] [2024-11-22 19:02:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 19:02:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:37,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175341235] [2024-11-22 19:02:37,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175341235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:37,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785313925] [2024-11-22 19:02:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:37,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:37,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:37,641 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:37,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 19:02:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:37,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 19:02:37,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:37,824 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-11-22 19:02:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 19:02:37,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 19:02:37,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785313925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:37,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 19:02:37,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2024-11-22 19:02:37,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66939216] [2024-11-22 19:02:37,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:37,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 19:02:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:37,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 19:02:37,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-22 19:02:37,870 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:37,908 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2024-11-22 19:02:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 19:02:37,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-22 19:02:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:37,909 INFO L225 Difference]: With dead ends: 96 [2024-11-22 19:02:37,909 INFO L226 Difference]: Without dead ends: 96 [2024-11-22 19:02:37,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-22 19:02:37,909 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:37,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-22 19:02:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-22 19:02:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 90 states have internal predecessors, (98), 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-11-22 19:02:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2024-11-22 19:02:37,912 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 48 [2024-11-22 19:02:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:37,912 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2024-11-22 19:02:37,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2024-11-22 19:02:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 19:02:37,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:37,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:37,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 19:02:38,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:38,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1826106878, now seen corresponding path program 1 times [2024-11-22 19:02:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248020723] [2024-11-22 19:02:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 19:02:38,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:38,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248020723] [2024-11-22 19:02:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248020723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:38,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:38,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:02:38,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559407609] [2024-11-22 19:02:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:38,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 19:02:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:38,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 19:02:38,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:38,246 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:38,316 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-22 19:02:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 19:02:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-22 19:02:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:38,318 INFO L225 Difference]: With dead ends: 95 [2024-11-22 19:02:38,318 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 19:02:38,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:38,318 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:38,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 288 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:02:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 19:02:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-22 19:02:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 89 states have internal predecessors, (97), 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-11-22 19:02:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-22 19:02:38,321 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 49 [2024-11-22 19:02:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:38,321 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-22 19:02:38,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 19:02:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-22 19:02:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 19:02:38,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:38,322 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:38,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 19:02:38,322 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:38,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1752914403, now seen corresponding path program 1 times [2024-11-22 19:02:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590923624] [2024-11-22 19:02:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 19:02:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590923624] [2024-11-22 19:02:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590923624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:02:38,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:02:38,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 19:02:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210950932] [2024-11-22 19:02:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:02:38,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 19:02:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 19:02:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 19:02:38,457 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 6 states, 4 states have (on average 7.0) internal successors, (28), 6 states have internal predecessors, (28), 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-11-22 19:02:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:38,503 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-11-22 19:02:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 19:02:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 51 [2024-11-22 19:02:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:38,504 INFO L225 Difference]: With dead ends: 95 [2024-11-22 19:02:38,504 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 19:02:38,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-22 19:02:38,505 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:38,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 160 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:02:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 19:02:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-11-22 19:02:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 87 states have internal predecessors, (95), 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-11-22 19:02:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-22 19:02:38,507 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 51 [2024-11-22 19:02:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:38,507 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-22 19:02:38,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.0) internal successors, (28), 6 states have internal predecessors, (28), 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-11-22 19:02:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-22 19:02:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 19:02:38,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:38,508 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:38,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 19:02:38,508 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:38,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1434365099, now seen corresponding path program 1 times [2024-11-22 19:02:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:38,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996718685] [2024-11-22 19:02:38,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-22 19:02:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:02:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996718685] [2024-11-22 19:02:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996718685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:02:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948995778] [2024-11-22 19:02:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:02:38,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:02:38,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 19:02:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:02:38,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 19:02:38,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:02:38,963 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 16 treesize of output 8 [2024-11-22 19:02:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:02:38,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:02:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 19:02:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948995778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:02:39,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:02:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 21 [2024-11-22 19:02:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215387460] [2024-11-22 19:02:39,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:02:39,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 19:02:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:02:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 19:02:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-11-22 19:02:39,105 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 19:02:43,129 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-11-22 19:02:47,141 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-11-22 19:02:51,163 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-11-22 19:02:55,201 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-11-22 19:02:59,400 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-11-22 19:02:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:02:59,642 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-11-22 19:02:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 19:02:59,642 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2024-11-22 19:02:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:02:59,643 INFO L225 Difference]: With dead ends: 154 [2024-11-22 19:02:59,643 INFO L226 Difference]: Without dead ends: 154 [2024-11-22 19:02:59,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 19:02:59,644 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 163 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-22 19:02:59,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1360 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 856 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-22 19:02:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-22 19:02:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 96. [2024-11-22 19:02:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.32) internal successors, (99), 90 states have internal predecessors, (99), 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-11-22 19:02:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-22 19:02:59,646 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 54 [2024-11-22 19:02:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:02:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-22 19:02:59,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 19:02:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-22 19:02:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 19:02:59,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:02:59,647 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:02:59,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-22 19:02:59,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:02:59,848 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:02:59,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:02:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1434365051, now seen corresponding path program 1 times [2024-11-22 19:02:59,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:02:59,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61498241] [2024-11-22 19:02:59,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:02:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:02:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 19:03:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61498241] [2024-11-22 19:03:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61498241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564357831] [2024-11-22 19:03:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:03:00,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:03:00,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 19:03:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:00,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-22 19:03:00,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:03:00,378 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 1 [2024-11-22 19:03:00,560 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-11-22 19:03:00,563 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-11-22 19:03:00,682 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:03:00,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-22 19:03:00,693 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 19:03:00,693 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-11-22 19:03:00,774 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 17 treesize of output 9 [2024-11-22 19:03:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 19:03:00,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:03:01,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564357831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:01,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:03:01,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2024-11-22 19:03:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519326343] [2024-11-22 19:03:01,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:03:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 19:03:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:03:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 19:03:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2024-11-22 19:03:01,006 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 28 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 24 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 19:03:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:03:01,788 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-22 19:03:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 19:03:01,789 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 24 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-22 19:03:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:03:01,789 INFO L225 Difference]: With dead ends: 127 [2024-11-22 19:03:01,789 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 19:03:01,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1812, Unknown=0, NotChecked=0, Total=1980 [2024-11-22 19:03:01,790 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 19:03:01,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1466 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 19:03:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 19:03:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2024-11-22 19:03:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 92 states have internal predecessors, (100), 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-11-22 19:03:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-22 19:03:01,793 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 54 [2024-11-22 19:03:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:03:01,793 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-22 19:03:01,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 24 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 19:03:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-22 19:03:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 19:03:01,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:03:01,793 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:03:01,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-22 19:03:01,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:01,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:03:01,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:03:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1167696907, now seen corresponding path program 1 times [2024-11-22 19:03:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:03:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133540338] [2024-11-22 19:03:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:03:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 19:03:02,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133540338] [2024-11-22 19:03:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133540338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:03:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:03:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 19:03:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930095227] [2024-11-22 19:03:02,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:03:02,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 19:03:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:03:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 19:03:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 19:03:02,187 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 10 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 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-11-22 19:03:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:03:02,342 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-22 19:03:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 19:03:02,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 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 54 [2024-11-22 19:03:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:03:02,343 INFO L225 Difference]: With dead ends: 138 [2024-11-22 19:03:02,343 INFO L226 Difference]: Without dead ends: 138 [2024-11-22 19:03:02,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 19:03:02,344 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:03:02,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 356 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:03:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-22 19:03:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2024-11-22 19:03:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 95 states have internal predecessors, (106), 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-11-22 19:03:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-11-22 19:03:02,346 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 54 [2024-11-22 19:03:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:03:02,346 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-11-22 19:03:02,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 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-11-22 19:03:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-11-22 19:03:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 19:03:02,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:03:02,351 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:03:02,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 19:03:02,351 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:03:02,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:03:02,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1167696906, now seen corresponding path program 1 times [2024-11-22 19:03:02,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:03:02,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178142988] [2024-11-22 19:03:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:03:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 19:03:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178142988] [2024-11-22 19:03:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178142988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699974396] [2024-11-22 19:03:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:02,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:02,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:03:02,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:03:02,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 19:03:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:02,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 19:03:02,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:03:02,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 19:03:02,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:03:02,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:02,928 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 16 treesize of output 11 [2024-11-22 19:03:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-22 19:03:02,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:03:03,018 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 30 treesize of output 26 [2024-11-22 19:03:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-22 19:03:03,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699974396] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:03,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:03:03,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12, 13] total 28 [2024-11-22 19:03:03,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096408596] [2024-11-22 19:03:03,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:03:03,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 19:03:03,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:03:03,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 19:03:03,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2024-11-22 19:03:03,225 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-11-22 19:03:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:03:03,483 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-11-22 19:03:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 19:03:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 54 [2024-11-22 19:03:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:03:03,484 INFO L225 Difference]: With dead ends: 114 [2024-11-22 19:03:03,484 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 19:03:03,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 19:03:03,485 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 81 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:03:03,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 636 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:03:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 19:03:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2024-11-22 19:03:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 94 states have internal predecessors, (103), 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-11-22 19:03:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-22 19:03:03,487 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 54 [2024-11-22 19:03:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:03:03,487 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-22 19:03:03,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-11-22 19:03:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-22 19:03:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 19:03:03,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:03:03,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:03:03,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 19:03:03,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 19:03:03,692 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:03:03,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:03:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1167696859, now seen corresponding path program 1 times [2024-11-22 19:03:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:03:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638060628] [2024-11-22 19:03:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:03:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 19:03:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638060628] [2024-11-22 19:03:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638060628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191377220] [2024-11-22 19:03:03,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:03,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:03,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:03:03,889 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:03:03,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 19:03:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:04,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 19:03:04,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:03:04,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 19:03:04,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:04,247 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 16 treesize of output 11 [2024-11-22 19:03:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:03:04,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:03:04,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:04,322 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 17 treesize of output 17 [2024-11-22 19:03:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-22 19:03:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191377220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 19:03:04,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 19:03:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 27 [2024-11-22 19:03:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930457844] [2024-11-22 19:03:04,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 19:03:04,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 19:03:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:03:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 19:03:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2024-11-22 19:03:04,459 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 24 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-22 19:03:08,473 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-11-22 19:03:12,481 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-11-22 19:03:16,503 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-11-22 19:03:20,545 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-11-22 19:03:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:03:20,770 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-22 19:03:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 19:03:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 24 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 54 [2024-11-22 19:03:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:03:20,771 INFO L225 Difference]: With dead ends: 93 [2024-11-22 19:03:20,771 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 19:03:20,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2024-11-22 19:03:20,772 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 143 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:03:20,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1087 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-11-22 19:03:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 19:03:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 19:03:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 87 states have internal predecessors, (94), 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-11-22 19:03:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2024-11-22 19:03:20,774 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 54 [2024-11-22 19:03:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:03:20,774 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2024-11-22 19:03:20,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.8518518518518516) internal successors, (77), 24 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-22 19:03:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-22 19:03:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 19:03:20,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:03:20,775 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:03:20,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-22 19:03:20,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-22 19:03:20,978 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:03:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:03:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1148380263, now seen corresponding path program 1 times [2024-11-22 19:03:20,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:03:20,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035838699] [2024-11-22 19:03:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:03:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:03:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035838699] [2024-11-22 19:03:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035838699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621583675] [2024-11-22 19:03:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:22,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:22,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:03:22,929 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:03:22,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 19:03:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:23,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-22 19:03:23,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:03:23,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:03:23,234 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 19:03:23,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-22 19:03:23,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 19:03:23,477 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 19 treesize of output 5 [2024-11-22 19:03:23,481 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 19:03:23,481 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 7 [2024-11-22 19:03:23,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:03:23,731 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 23 [2024-11-22 19:03:23,755 INFO L349 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2024-11-22 19:03:23,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 64 [2024-11-22 19:03:23,980 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-22 19:03:23,981 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 51 treesize of output 52 [2024-11-22 19:03:24,102 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-22 19:03:24,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 74 [2024-11-22 19:03:24,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 19:03:24,278 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 134 treesize of output 98 [2024-11-22 19:03:24,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:24,292 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 111 treesize of output 91 [2024-11-22 19:03:24,533 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 79 treesize of output 43 [2024-11-22 19:03:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:03:24,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:03:25,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621583675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:25,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:03:25,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 29] total 62 [2024-11-22 19:03:25,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869135714] [2024-11-22 19:03:25,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:03:25,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-22 19:03:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:03:25,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-22 19:03:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4901, Unknown=2, NotChecked=0, Total=5112 [2024-11-22 19:03:25,610 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 63 states, 60 states have (on average 1.65) internal successors, (99), 54 states have internal predecessors, (99), 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-11-22 19:03:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:03:28,674 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-22 19:03:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-22 19:03:28,674 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 60 states have (on average 1.65) internal successors, (99), 54 states have internal predecessors, (99), 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 59 [2024-11-22 19:03:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:03:28,675 INFO L225 Difference]: With dead ends: 108 [2024-11-22 19:03:28,675 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 19:03:28,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1943 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=525, Invalid=8979, Unknown=2, NotChecked=0, Total=9506 [2024-11-22 19:03:28,677 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 227 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 19:03:28,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1569 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 19:03:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 19:03:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2024-11-22 19:03:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 91 states have internal predecessors, (102), 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-11-22 19:03:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-22 19:03:28,679 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2024-11-22 19:03:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:03:28,679 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-22 19:03:28,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 60 states have (on average 1.65) internal successors, (99), 54 states have internal predecessors, (99), 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-11-22 19:03:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-22 19:03:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 19:03:28,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:03:28,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:03:28,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 19:03:28,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-22 19:03:28,880 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:03:28,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:03:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1148380264, now seen corresponding path program 1 times [2024-11-22 19:03:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:03:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666796316] [2024-11-22 19:03:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:03:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:03:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666796316] [2024-11-22 19:03:30,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666796316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97199290] [2024-11-22 19:03:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:30,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:30,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:03:30,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:03:30,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 19:03:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:30,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-22 19:03:30,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:03:30,591 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 19:03:30,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 19:03:30,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 19:03:30,688 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 13 treesize of output 9 [2024-11-22 19:03:30,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 19:03:30,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 19 [2024-11-22 19:03:30,898 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 17 treesize of output 3 [2024-11-22 19:03:30,900 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-11-22 19:03:30,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-22 19:03:31,111 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:03:31,111 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 26 treesize of output 29 [2024-11-22 19:03:31,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-22 19:03:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 19:03:31,127 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 69 treesize of output 52 [2024-11-22 19:03:31,144 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2024-11-22 19:03:31,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 41 [2024-11-22 19:03:31,159 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-22 19:03:31,159 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 34 treesize of output 36 [2024-11-22 19:03:31,378 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-22 19:03:31,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2024-11-22 19:03:31,390 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2024-11-22 19:03:31,390 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 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-22 19:03:31,504 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-22 19:03:31,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 107 [2024-11-22 19:03:31,518 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-22 19:03:31,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 140 [2024-11-22 19:03:31,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 19:03:31,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 19:03:31,660 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 19:03:31,891 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 354 treesize of output 266 [2024-11-22 19:03:31,896 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 270 treesize of output 214 [2024-11-22 19:03:32,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:32,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 145 [2024-11-22 19:03:32,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:32,267 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 115 treesize of output 115 [2024-11-22 19:03:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:03:32,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:03:35,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97199290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:35,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:03:35,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 53 [2024-11-22 19:03:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053368414] [2024-11-22 19:03:35,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:03:35,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-22 19:03:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:03:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-22 19:03:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3766, Unknown=91, NotChecked=0, Total=4032 [2024-11-22 19:03:35,218 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 54 states, 51 states have (on average 2.0) internal successors, (102), 47 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:03:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:03:42,886 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-22 19:03:42,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 19:03:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 2.0) internal successors, (102), 47 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 59 [2024-11-22 19:03:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:03:42,887 INFO L225 Difference]: With dead ends: 112 [2024-11-22 19:03:42,887 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 19:03:42,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=463, Invalid=7454, Unknown=93, NotChecked=0, Total=8010 [2024-11-22 19:03:42,888 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 179 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 19:03:42,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1719 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 19:03:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 19:03:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2024-11-22 19:03:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3125) internal successors, (105), 95 states have internal predecessors, (105), 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-11-22 19:03:42,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-22 19:03:42,891 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 59 [2024-11-22 19:03:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:03:42,891 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-22 19:03:42,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 2.0) internal successors, (102), 47 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 19:03:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-22 19:03:42,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 19:03:42,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:03:42,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:03:42,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-22 19:03:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-22 19:03:43,092 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:03:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:03:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1240076240, now seen corresponding path program 1 times [2024-11-22 19:03:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:03:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604246031] [2024-11-22 19:03:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:03:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:03:43,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:43,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604246031] [2024-11-22 19:03:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604246031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:43,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244486933] [2024-11-22 19:03:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:43,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:43,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:03:43,950 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:03:43,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 19:03:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:44,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-22 19:03:44,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:03:44,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 19:03:44,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 19:03:44,436 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-22 19:03:44,437 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 17 [2024-11-22 19:03:44,646 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 29 treesize of output 21 [2024-11-22 19:03:44,652 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-11-22 19:03:44,898 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 19:03:44,898 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-11-22 19:03:44,909 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 38 treesize of output 33 [2024-11-22 19:03:45,379 INFO L349 Elim1Store]: treesize reduction 41, result has 41.4 percent of original size [2024-11-22 19:03:45,380 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 57 treesize of output 51 [2024-11-22 19:03:45,482 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 38 treesize of output 33 [2024-11-22 19:03:45,574 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 37 treesize of output 29 [2024-11-22 19:03:45,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:45,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 59 [2024-11-22 19:03:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:03:45,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:03:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244486933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:46,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 19:03:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 53 [2024-11-22 19:03:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604722588] [2024-11-22 19:03:46,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 19:03:46,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-22 19:03:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:03:46,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-22 19:03:46,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=3706, Unknown=1, NotChecked=0, Total=3906 [2024-11-22 19:03:46,436 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 53 states, 51 states have (on average 2.0) internal successors, (102), 46 states have internal predecessors, (102), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 19:03:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:03:48,475 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2024-11-22 19:03:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-22 19:03:48,475 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 2.0) internal successors, (102), 46 states have internal predecessors, (102), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 60 [2024-11-22 19:03:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:03:48,476 INFO L225 Difference]: With dead ends: 105 [2024-11-22 19:03:48,476 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 19:03:48,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=453, Invalid=7202, Unknown=1, NotChecked=0, Total=7656 [2024-11-22 19:03:48,478 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 113 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 19:03:48,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1768 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 19:03:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 19:03:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2024-11-22 19:03:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3) internal successors, (104), 95 states have internal predecessors, (104), 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-11-22 19:03:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-22 19:03:48,480 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 60 [2024-11-22 19:03:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:03:48,480 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-22 19:03:48,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 2.0) internal successors, (102), 46 states have internal predecessors, (102), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 19:03:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-22 19:03:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 19:03:48,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:03:48,481 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:03:48,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-22 19:03:48,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:48,682 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 19:03:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:03:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1311558279, now seen corresponding path program 1 times [2024-11-22 19:03:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:03:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447502605] [2024-11-22 19:03:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:03:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 19:03:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:03:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447502605] [2024-11-22 19:03:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447502605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 19:03:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530116056] [2024-11-22 19:03:49,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:03:49,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 19:03:49,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:03:49,636 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 19:03:49,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 19:03:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:03:49,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-22 19:03:49,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 19:03:49,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2024-11-22 19:03:50,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 19:03:50,181 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-11-22 19:03:50,183 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-11-22 19:03:50,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 19:03:50,446 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 19:03:50,446 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-11-22 19:03:50,459 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 19:03:50,459 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-11-22 19:03:50,861 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 11 [2024-11-22 19:03:50,865 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 39 treesize of output 3 [2024-11-22 19:03:50,872 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 24 treesize of output 11 [2024-11-22 19:03:50,940 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-22 19:03:50,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2024-11-22 19:03:50,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2024-11-22 19:03:50,952 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 36 treesize of output 15 [2024-11-22 19:03:51,040 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 50 treesize of output 30 [2024-11-22 19:03:51,155 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-11-22 19:03:51,159 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 15 treesize of output 7 [2024-11-22 19:03:51,277 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 15 treesize of output 7 [2024-11-22 19:03:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 19:03:51,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 19:03:51,663 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2426 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse0 (select v_ArrVal_2428 .cse0))) v_ArrVal_2428)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse1) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2426) .cse1) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))) is different from false [2024-11-22 19:03:51,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:51,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-22 19:03:51,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:51,686 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 76 treesize of output 75 [2024-11-22 19:03:51,692 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 29 treesize of output 21 [2024-11-22 19:03:52,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4)) (.cse3 (+ .cse10 4)) (.cse5 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse11 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse2))) (let ((.cse6 (not .cse11)) (.cse8 (forall ((v_ArrVal_2424 Int)) (or (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (forall ((v_ArrVal_2427 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2425))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428))) (or (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0)))))) (.cse9 (or (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int) (v_ArrVal_2424 Int)) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2425))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (not (= (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))) .cse11))) (and (forall ((v_ArrVal_2424 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2428 |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) (not (= (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424))) (or .cse6 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2425))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (not (= (store (select .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)))))) (or (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse2) (and .cse8 .cse9 (or .cse6 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424)))))) (or (and .cse8 .cse9) (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| .cse10)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_2424 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 v_DerPreprocessor_6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)))) .cse11))))) is different from false [2024-11-22 19:03:52,877 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|)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4)) (.cse4 (+ .cse11 4)) (.cse5 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse3))) (let ((.cse6 (not .cse0)) (.cse7 (or (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int) (v_ArrVal_2424 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2425))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))) .cse0)) (.cse8 (forall ((v_ArrVal_2424 Int)) (or (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (forall ((v_ArrVal_2427 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int)) (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2425))) (let ((.cse13 (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428))) (or (not (= (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0))))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_2424 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 v_DerPreprocessor_6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))) (or (and (or .cse6 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424)))) .cse7 .cse8) (= .cse3 |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (forall ((v_ArrVal_2424 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2428 |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (not (= (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)))))) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424))) (or .cse6 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (let ((.cse10 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2425))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse3) .cse4) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (not (= (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424))))) (or (= .cse11 |c_ULTIMATE.start_sll_insert_~last~0#1.offset|) (and .cse7 .cse8)))))) is different from false [2024-11-22 19:03:53,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| 4)) (.cse3 (+ .cse10 4)) (.cse5 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse11 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse2))) (let ((.cse6 (not .cse11)) (.cse8 (or (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int) (v_ArrVal_2424 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (not (= v_ArrVal_2428 (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5))))))) .cse11)) (.cse9 (forall ((v_ArrVal_2424 Int)) (or (forall ((v_ArrVal_2427 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int)) (let ((.cse13 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2425))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) (not (= v_ArrVal_2428 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)))))))))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424))))) (and (forall ((v_ArrVal_2424 Int)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2425))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2428 |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) (not (= v_ArrVal_2428 (store (select .cse4 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5))))))))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424))) (or .cse6 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2425))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (not (= v_ArrVal_2428 (store (select .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)))))) (or (and .cse8 .cse9) (= |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset| .cse10)) (or (and (or .cse6 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 (select v_ArrVal_2428 .cse5)) v_ArrVal_2428)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))) .cse8 .cse9) (= |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| .cse2)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_2424 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse5 v_DerPreprocessor_6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| (store .cse0 .cse1 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse2) .cse3) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424))) .cse11))))) is different from false [2024-11-22 19:03:53,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse2)) (.cse4 (+ .cse12 4)) (.cse6 (+ .cse11 4)) (.cse8 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse5))) (let ((.cse9 (or (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int) (v_ArrVal_2424 Int)) (let ((.cse16 (store |c_#memory_int#2| .cse2 v_ArrVal_2425))) (or (= (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (not (= v_ArrVal_2428 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2428 .cse1)))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 .cse4 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse5) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)))) .cse8)) (.cse7 (not .cse8)) (.cse10 (forall ((v_ArrVal_2424 Int)) (or (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (forall ((v_ArrVal_2427 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int)) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int)) (let ((.cse15 (store |c_#memory_int#2| .cse2 v_ArrVal_2425))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428))) (or (= (select (select .cse14 v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) (not (= v_ArrVal_2428 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2428 .cse1)))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 .cse4 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse5) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))))) (and (or (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (let ((.cse0 (store |c_#memory_int#2| .cse2 v_ArrVal_2425))) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (not (= v_ArrVal_2428 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2428 .cse1)))) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 .cse4 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse5) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_2424 Int)) (or (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse2 v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 .cse4 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse5) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) .cse8) (or (and .cse9 .cse10) (= .cse11 .cse12)) (forall ((v_ArrVal_2424 Int)) (or (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| .cse2 v_ArrVal_2425))) (or (forall ((v_arrayElimCell_113 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2428 |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (not (= v_ArrVal_2428 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2428 .cse1))))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 .cse4 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse5) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|))))) (or (and .cse9 (or (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (or (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_2428 .cse1)) v_ArrVal_2428)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (< |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| v_ArrVal_2424) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse2 (store .cse3 .cse4 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2427) .cse5) .cse6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int#2| .cse2 v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)))) .cse7) .cse10) (= .cse5 .cse2)))))) is different from false [2024-11-22 19:03:53,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse3)) (.cse5 (+ .cse11 4)) (.cse7 (+ .cse10 4)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse12 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse6))) (let ((.cse0 (not .cse12)) (.cse8 (forall ((v_ArrVal_2424 Int)) (or (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| v_ArrVal_2424) (forall ((v_ArrVal_2427 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 .cse5 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2427) .cse6) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int)) (let ((.cse15 (store |c_#memory_int#2| .cse3 v_ArrVal_2425))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2428))) (or (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse2 (select v_ArrVal_2428 .cse2)) v_ArrVal_2428)) (forall ((v_arrayElimCell_113 Int)) (= (select (select .cse16 v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|)) (= (select (select .cse16 v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0)))))) (.cse9 (or (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_112 Int) (v_ArrVal_2424 Int)) (let ((.cse14 (store |c_#memory_int#2| .cse3 v_ArrVal_2425))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse2 (select v_ArrVal_2428 .cse2)) v_ArrVal_2428)) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 .cse5 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2427) .cse6) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| v_ArrVal_2424) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (= (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2428) v_arrayElimCell_112) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse12))) (and (or .cse0 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (let ((.cse1 (store |c_#memory_int#2| .cse3 v_ArrVal_2425))) (or (not (= (store (select .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse2 (select v_ArrVal_2428 .cse2)) v_ArrVal_2428)) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 .cse5 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2427) .cse6) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| v_ArrVal_2424) (= (select (select (store .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0))))) (or (and (or .cse0 (forall ((v_ArrVal_2428 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_arrayElimCell_113 Int) (v_ArrVal_2424 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 .cse5 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2427) .cse6) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| v_ArrVal_2424) (= (select (select (store (store |c_#memory_int#2| .cse3 v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse2 (select v_ArrVal_2428 .cse2)) v_ArrVal_2428)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0)))) .cse8 .cse9) (= .cse6 .cse3)) (or (and .cse8 .cse9) (= .cse10 .cse11)) (or (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2425 (Array Int Int)) (v_DerPreprocessor_6 Int) (v_ArrVal_2424 Int)) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#2| .cse3 v_ArrVal_2425) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse2 v_DerPreprocessor_6) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 .cse5 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2427) .cse6) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| v_ArrVal_2424) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0))) .cse12) (forall ((v_ArrVal_2424 Int)) (or (< |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset| v_ArrVal_2424) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_37| Int) (v_ArrVal_2427 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse3 (store .cse4 .cse5 v_ArrVal_2424)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2427) .cse6) .cse7) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_37| 0) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#2| .cse3 v_ArrVal_2425))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse2 (select v_ArrVal_2428 .cse2)) v_ArrVal_2428)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_2428 |v_ULTIMATE.start_main_~ptr~0#1.offset_37|)) (forall ((v_arrayElimCell_113 Int)) (= (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2428) v_arrayElimCell_113) |v_ULTIMATE.start_main_~ptr~0#1.offset_37|) |c_ULTIMATE.start_main_~uneq~0#1|))))))))))))) is different from false [2024-11-22 19:03:56,124 INFO L349 Elim1Store]: treesize reduction 405, result has 30.9 percent of original size [2024-11-22 19:03:56,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 1727 treesize of output 1820 [2024-11-22 19:03:57,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 19:03:57,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1398 treesize of output 1724 [2024-11-22 19:03:57,732 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-22 19:03:57,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1296 treesize of output 1307 [2024-11-22 19:03:57,945 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-22 19:03:57,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1287 treesize of output 1300 [2024-11-22 19:03:58,039 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 1280 treesize of output 1278 [2024-11-22 19:03:58,266 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-22 19:03:58,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1278 treesize of output 1289 [2024-11-22 19:03:58,482 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-22 19:03:58,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1269 treesize of output 1282 [2024-11-22 19:03:58,704 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-22 19:03:58,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1262 treesize of output 1275 [2024-11-22 19:03:58,933 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-11-22 19:03:58,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1255 treesize of output 1268 [2024-11-22 19:03:59,084 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 1258 treesize of output 1256