./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:15:27,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:15:27,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:15:27,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:15:27,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:15:27,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:15:27,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:15:27,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:15:27,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:15:27,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:15:27,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:15:27,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:15:27,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:15:27,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:15:27,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:15:27,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:15:27,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:15:27,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:15:27,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:15:27,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:15:27,236 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:15:27,236 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:15:27,237 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:15:27,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:15:27,237 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:15:27,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:15:27,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:15:27,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:15:27,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:15:27,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:15:27,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:15:27,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:15:27,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:15:27,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:15:27,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:15:27,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:15:27,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:15:27,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:15:27,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:15:27,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:15:27,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:15:27,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:15:27,245 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2024-10-11 18:15:27,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:15:27,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:15:27,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:15:27,532 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:15:27,533 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:15:27,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-10-11 18:15:28,932 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:15:29,156 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:15:29,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2024-10-11 18:15:29,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a3f68543/ea4b2dcd83f4469f922816107ac08de1/FLAG75cae862f [2024-10-11 18:15:29,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a3f68543/ea4b2dcd83f4469f922816107ac08de1 [2024-10-11 18:15:29,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:15:29,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:15:29,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:15:29,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:15:29,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:15:29,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739185e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29, skipping insertion in model container [2024-10-11 18:15:29,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:15:29,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:15:29,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:15:29,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:15:29,736 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:15:29,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29 WrapperNode [2024-10-11 18:15:29,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:15:29,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:15:29,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:15:29,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:15:29,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,795 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 157 [2024-10-11 18:15:29,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:15:29,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:15:29,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:15:29,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:15:29,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,850 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 9, 20]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 14 writes are split as follows [0, 1, 13]. [2024-10-11 18:15:29,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:15:29,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:15:29,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:15:29,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:15:29,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (1/1) ... [2024-10-11 18:15:29,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:15:29,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:29,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:15:29,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:15:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:15:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:15:29,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:15:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:15:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:15:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:15:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 18:15:29,987 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 18:15:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:15:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:15:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:15:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:15:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:15:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:15:29,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:15:29,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:15:29,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:15:29,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:15:29,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:15:30,143 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:15:30,145 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:15:30,578 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-10-11 18:15:30,579 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:15:30,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:15:30,642 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:15:30,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:30 BoogieIcfgContainer [2024-10-11 18:15:30,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:15:30,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:15:30,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:15:30,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:15:30,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:15:29" (1/3) ... [2024-10-11 18:15:30,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d26108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:30, skipping insertion in model container [2024-10-11 18:15:30,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:15:29" (2/3) ... [2024-10-11 18:15:30,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d26108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:15:30, skipping insertion in model container [2024-10-11 18:15:30,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:15:30" (3/3) ... [2024-10-11 18:15:30,654 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2024-10-11 18:15:30,668 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:15:30,668 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2024-10-11 18:15:30,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:15:30,726 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;@38610975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:15:30,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2024-10-11 18:15:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:15:30,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:30,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:15:30,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:30,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash 246683571, now seen corresponding path program 1 times [2024-10-11 18:15:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334584512] [2024-10-11 18:15:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334584512] [2024-10-11 18:15:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334584512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:31,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:31,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:15:31,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345880819] [2024-10-11 18:15:31,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:31,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:15:31,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:15:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:15:31,076 INFO L87 Difference]: Start difference. First operand has 127 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 122 states have internal predecessors, (136), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:15:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:31,259 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2024-10-11 18:15:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:15:31,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:15:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:31,272 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:15:31,273 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:15:31,275 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-10-11 18:15:31,278 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:31,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 180 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:15:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 18:15:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 56 states have (on average 2.2142857142857144) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2024-10-11 18:15:31,330 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 5 [2024-10-11 18:15:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:31,331 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2024-10-11 18:15:31,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:15:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2024-10-11 18:15:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:15:31,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:31,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:15:31,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:15:31,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:31,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash 246683572, now seen corresponding path program 1 times [2024-10-11 18:15:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:31,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329619593] [2024-10-11 18:15:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329619593] [2024-10-11 18:15:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329619593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:31,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:31,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:15:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398616915] [2024-10-11 18:15:31,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:31,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:15:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:31,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:15:31,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:15:31,477 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:15:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:31,585 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-10-11 18:15:31,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:15:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-10-11 18:15:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:31,587 INFO L225 Difference]: With dead ends: 118 [2024-10-11 18:15:31,588 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 18:15:31,588 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-10-11 18:15:31,589 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:31,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 184 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 18:15:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 18:15:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2024-10-11 18:15:31,600 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 5 [2024-10-11 18:15:31,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:31,600 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-10-11 18:15:31,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 18:15:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2024-10-11 18:15:31,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:15:31,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:31,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:31,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:15:31,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 438481457, now seen corresponding path program 1 times [2024-10-11 18:15:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820488799] [2024-10-11 18:15:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820488799] [2024-10-11 18:15:31,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820488799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:31,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:31,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:15:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101175089] [2024-10-11 18:15:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:31,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:15:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:31,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:15:31,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:15:31,778 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:15:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:31,949 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2024-10-11 18:15:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:15:31,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 18:15:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:31,951 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:15:31,951 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:15:31,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:15:31,952 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:31,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:15:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 18:15:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.1403508771929824) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-10-11 18:15:31,968 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 11 [2024-10-11 18:15:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:31,969 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-10-11 18:15:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:15:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2024-10-11 18:15:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:15:31,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:31,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:31,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:15:31,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:31,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 617829281, now seen corresponding path program 1 times [2024-10-11 18:15:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087596227] [2024-10-11 18:15:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:32,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:32,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:32,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087596227] [2024-10-11 18:15:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087596227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:15:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517810685] [2024-10-11 18:15:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:32,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:32,253 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 18:15:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:32,630 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-10-11 18:15:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2024-10-11 18:15:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:32,632 INFO L225 Difference]: With dead ends: 118 [2024-10-11 18:15:32,632 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 18:15:32,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:32,636 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:32,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 370 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:15:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 18:15:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 18:15:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 57 states have (on average 2.1228070175438596) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2024-10-11 18:15:32,649 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 19 [2024-10-11 18:15:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:32,650 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2024-10-11 18:15:32,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 18:15:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2024-10-11 18:15:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:15:32,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:32,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:15:32,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:32,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 617829282, now seen corresponding path program 1 times [2024-10-11 18:15:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442913659] [2024-10-11 18:15:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:32,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442913659] [2024-10-11 18:15:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442913659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:32,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:32,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:15:32,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861658235] [2024-10-11 18:15:32,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:32,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:32,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:32,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:32,993 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-11 18:15:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:33,256 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2024-10-11 18:15:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:33,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2024-10-11 18:15:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:33,259 INFO L225 Difference]: With dead ends: 117 [2024-10-11 18:15:33,259 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 18:15:33,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:33,261 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:33,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 394 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:15:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 18:15:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 18:15:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 112 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2024-10-11 18:15:33,275 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 19 [2024-10-11 18:15:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:33,276 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2024-10-11 18:15:33,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-11 18:15:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2024-10-11 18:15:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:15:33,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:33,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:33,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:15:33,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1028451906, now seen corresponding path program 1 times [2024-10-11 18:15:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645150395] [2024-10-11 18:15:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:33,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645150395] [2024-10-11 18:15:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645150395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964539999] [2024-10-11 18:15:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:33,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:33,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:33,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:33,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:15:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:33,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:15:33,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:33,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 6 treesize of output 5 [2024-10-11 18:15:33,898 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-10-11 18:15:33,939 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:15:33,940 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 12 treesize of output 14 [2024-10-11 18:15:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:15:33,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:15:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964539999] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:15:34,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:15:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-10-11 18:15:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822218688] [2024-10-11 18:15:34,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:15:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:15:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:15:34,136 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:15:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:34,449 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2024-10-11 18:15:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:34,450 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-10-11 18:15:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:34,452 INFO L225 Difference]: With dead ends: 122 [2024-10-11 18:15:34,452 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 18:15:34,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:15:34,453 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:34,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 428 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2024-10-11 18:15:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 18:15:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 18:15:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0655737704918034) internal successors, (126), 116 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2024-10-11 18:15:34,460 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 21 [2024-10-11 18:15:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:34,460 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2024-10-11 18:15:34,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:15:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2024-10-11 18:15:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:15:34,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:34,461 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:34,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 18:15:34,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:34,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:34,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1028451907, now seen corresponding path program 1 times [2024-10-11 18:15:34,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:34,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963230709] [2024-10-11 18:15:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:35,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:35,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963230709] [2024-10-11 18:15:35,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963230709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297824949] [2024-10-11 18:15:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:35,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:35,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:35,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:15:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:35,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 18:15:35,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:35,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:35,310 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-10-11 18:15:35,400 WARN L873 $PredicateComparison]: unable to prove that (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-10-11 18:15:35,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:35,442 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-10-11 18:15:35,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:35,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:15:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:15:35,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297824949] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:35,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2024-10-11 18:15:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870730911] [2024-10-11 18:15:35,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:15:35,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:35,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:15:35,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:15:35,579 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:36,056 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2024-10-11 18:15:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:36,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-11 18:15:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:36,057 INFO L225 Difference]: With dead ends: 122 [2024-10-11 18:15:36,057 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 18:15:36,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:15:36,058 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:36,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 570 Invalid, 0 Unknown, 128 Unchecked, 0.4s Time] [2024-10-11 18:15:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 18:15:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 18:15:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-10-11 18:15:36,072 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 21 [2024-10-11 18:15:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:36,073 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-10-11 18:15:36,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-10-11 18:15:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:15:36,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:36,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:36,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:36,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:36,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:36,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash 499957720, now seen corresponding path program 1 times [2024-10-11 18:15:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:36,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253177772] [2024-10-11 18:15:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:36,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:36,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253177772] [2024-10-11 18:15:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253177772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001571464] [2024-10-11 18:15:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:36,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:36,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:36,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:36,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:15:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:36,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:15:36,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:36,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001571464] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:15:36,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:15:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-10-11 18:15:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368973536] [2024-10-11 18:15:36,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:36,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:36,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:36,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:36,621 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:36,781 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2024-10-11 18:15:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:36,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 18:15:36,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:36,783 INFO L225 Difference]: With dead ends: 122 [2024-10-11 18:15:36,783 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 18:15:36,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:36,784 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:36,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 557 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 18:15:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 18:15:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 116 states have internal predecessors, (124), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2024-10-11 18:15:36,789 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 23 [2024-10-11 18:15:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:36,789 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2024-10-11 18:15:36,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:15:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2024-10-11 18:15:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:15:36,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:36,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:36,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:15:36,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:36,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1685960527, now seen corresponding path program 1 times [2024-10-11 18:15:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:36,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860915853] [2024-10-11 18:15:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:37,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:37,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860915853] [2024-10-11 18:15:37,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860915853] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:37,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116628043] [2024-10-11 18:15:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:37,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:37,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:37,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:37,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:15:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:37,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:15:37,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:37,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:37,329 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:15:37,363 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:15:37,364 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 19 treesize of output 16 [2024-10-11 18:15:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-11 18:15:37,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:37,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116628043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:37,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:37,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2024-10-11 18:15:37,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126414878] [2024-10-11 18:15:37,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:37,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:15:37,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:37,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:15:37,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2024-10-11 18:15:37,439 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:37,736 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-10-11 18:15:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-11 18:15:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:37,737 INFO L225 Difference]: With dead ends: 121 [2024-10-11 18:15:37,737 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:15:37,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=149, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:15:37,738 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 9 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:37,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 525 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 441 Invalid, 0 Unknown, 126 Unchecked, 0.2s Time] [2024-10-11 18:15:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:15:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 18:15:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 115 states have internal predecessors, (123), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:15:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-10-11 18:15:37,743 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 24 [2024-10-11 18:15:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-10-11 18:15:37,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-10-11 18:15:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:15:37,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:37,744 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:37,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:15:37,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 18:15:37,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:37,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:37,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1685960526, now seen corresponding path program 1 times [2024-10-11 18:15:37,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:37,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441383521] [2024-10-11 18:15:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:38,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:38,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441383521] [2024-10-11 18:15:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441383521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182471609] [2024-10-11 18:15:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:38,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:38,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:38,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:38,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:15:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:38,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:15:38,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:38,327 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-10-11 18:15:38,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:38,463 WARN L873 $PredicateComparison]: unable to prove that (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-10-11 18:15:38,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:38,503 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-10-11 18:15:38,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:38,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:15:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-11 18:15:38,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182471609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:38,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 18:15:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153304952] [2024-10-11 18:15:38,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:38,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:15:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:38,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:15:38,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=230, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:15:38,682 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:39,109 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2024-10-11 18:15:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:15:39,109 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2024-10-11 18:15:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:39,111 INFO L225 Difference]: With dead ends: 138 [2024-10-11 18:15:39,111 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 18:15:39,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=353, Unknown=1, NotChecked=38, Total=462 [2024-10-11 18:15:39,113 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 20 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:39,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 723 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 514 Invalid, 0 Unknown, 148 Unchecked, 0.3s Time] [2024-10-11 18:15:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 18:15:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2024-10-11 18:15:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.957142857142857) internal successors, (137), 124 states have internal predecessors, (137), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:15:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2024-10-11 18:15:39,118 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 24 [2024-10-11 18:15:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:39,119 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2024-10-11 18:15:39,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:15:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2024-10-11 18:15:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:15:39,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:39,120 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:39,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:15:39,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:15:39,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -725168780, now seen corresponding path program 1 times [2024-10-11 18:15:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370442220] [2024-10-11 18:15:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:39,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370442220] [2024-10-11 18:15:39,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370442220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:39,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:39,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:15:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134731505] [2024-10-11 18:15:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:39,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:15:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:39,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:15:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:39,485 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-11 18:15:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:39,752 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-10-11 18:15:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 25 [2024-10-11 18:15:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:39,754 INFO L225 Difference]: With dead ends: 130 [2024-10-11 18:15:39,754 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 18:15:39,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:39,755 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:39,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 422 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:15:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 18:15:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 18:15:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 70 states have (on average 1.9428571428571428) internal successors, (136), 123 states have internal predecessors, (136), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:15:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2024-10-11 18:15:39,759 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 25 [2024-10-11 18:15:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:39,759 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2024-10-11 18:15:39,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-10-11 18:15:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2024-10-11 18:15:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:15:39,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:39,760 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:39,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:15:39,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:39,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash -725168779, now seen corresponding path program 1 times [2024-10-11 18:15:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:39,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3424758] [2024-10-11 18:15:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:15:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3424758] [2024-10-11 18:15:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3424758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:40,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:15:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801203916] [2024-10-11 18:15:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:40,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:15:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:40,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:15:40,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:40,036 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-11 18:15:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:40,299 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2024-10-11 18:15:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 25 [2024-10-11 18:15:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:40,300 INFO L225 Difference]: With dead ends: 129 [2024-10-11 18:15:40,300 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 18:15:40,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:40,301 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:40,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 447 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:15:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 18:15:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-11 18:15:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 122 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:15:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2024-10-11 18:15:40,305 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 25 [2024-10-11 18:15:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2024-10-11 18:15:40,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-11 18:15:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2024-10-11 18:15:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:15:40,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:40,308 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:40,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:15:40,308 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:40,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:40,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1793219453, now seen corresponding path program 1 times [2024-10-11 18:15:40,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:40,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49832508] [2024-10-11 18:15:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:15:40,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:40,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49832508] [2024-10-11 18:15:40,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49832508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:40,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247282425] [2024-10-11 18:15:40,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:40,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:40,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:40,825 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:15:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:41,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 18:15:41,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:41,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:41,040 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-10-11 18:15:41,058 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-10-11 18:15:41,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:41,088 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-10-11 18:15:41,104 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-10-11 18:15:41,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:41,150 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-10-11 18:15:41,168 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-10-11 18:15:41,189 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:15:41,189 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 12 treesize of output 14 [2024-10-11 18:15:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2024-10-11 18:15:41,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247282425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:41,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-10-11 18:15:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145919529] [2024-10-11 18:15:41,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:41,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:15:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:15:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-10-11 18:15:41,358 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:15:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:41,722 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2024-10-11 18:15:41,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:41,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2024-10-11 18:15:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:41,724 INFO L225 Difference]: With dead ends: 138 [2024-10-11 18:15:41,724 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 18:15:41,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-10-11 18:15:41,725 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:41,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 237 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 361 Invalid, 0 Unknown, 254 Unchecked, 0.3s Time] [2024-10-11 18:15:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 18:15:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2024-10-11 18:15:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.8142857142857143) internal successors, (127), 114 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:15:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2024-10-11 18:15:41,731 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 34 [2024-10-11 18:15:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:41,731 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2024-10-11 18:15:41,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 18:15:41,732 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2024-10-11 18:15:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:15:41,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:41,734 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:41,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:41,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:15:41,935 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:41,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1793219452, now seen corresponding path program 1 times [2024-10-11 18:15:41,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:41,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022014717] [2024-10-11 18:15:41,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:41,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:42,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:42,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:15:42,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022014717] [2024-10-11 18:15:42,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022014717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989231663] [2024-10-11 18:15:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:42,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:42,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:42,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:15:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:42,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:15:42,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:42,759 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-10-11 18:15:42,767 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-10-11 18:15:42,786 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-10-11 18:15:42,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:42,809 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-10-11 18:15:42,828 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-10-11 18:15:42,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:42,859 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-10-11 18:15:42,926 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-10-11 18:15:42,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:42,956 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-10-11 18:15:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 18:15:42,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:15:42,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989231663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:42,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:15:42,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 18:15:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064988051] [2024-10-11 18:15:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:42,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:42,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:42,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:42,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=123, Unknown=1, NotChecked=22, Total=182 [2024-10-11 18:15:42,967 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:43,139 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-10-11 18:15:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-11 18:15:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:43,141 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:15:43,141 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:15:43,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-10-11 18:15:43,142 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:43,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 260 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2024-10-11 18:15:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:15:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 18:15:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.7428571428571429) internal successors, (122), 109 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:15:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2024-10-11 18:15:43,146 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 34 [2024-10-11 18:15:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:43,147 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2024-10-11 18:15:43,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2024-10-11 18:15:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:15:43,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:43,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:43,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:15:43,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:43,348 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:43,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:43,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1191339202, now seen corresponding path program 1 times [2024-10-11 18:15:43,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:43,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211351011] [2024-10-11 18:15:43,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:43,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 18:15:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 18:15:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211351011] [2024-10-11 18:15:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211351011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:43,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:15:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74252908] [2024-10-11 18:15:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:43,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:15:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:15:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:15:43,465 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:43,566 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2024-10-11 18:15:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:15:43,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-10-11 18:15:43,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:43,567 INFO L225 Difference]: With dead ends: 98 [2024-10-11 18:15:43,567 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 18:15:43,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:15:43,568 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:43,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:43,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 18:15:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 18:15:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.736842105263158) internal successors, (99), 93 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-10-11 18:15:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-10-11 18:15:43,573 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2024-10-11 18:15:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:43,573 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-10-11 18:15:43,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-10-11 18:15:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:15:43,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:43,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:43,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:15:43,574 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:43,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1002008060, now seen corresponding path program 1 times [2024-10-11 18:15:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23925965] [2024-10-11 18:15:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 18:15:43,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23925965] [2024-10-11 18:15:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23925965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:43,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:15:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970002441] [2024-10-11 18:15:43,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:43,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:15:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:43,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:15:43,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:43,738 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:43,929 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2024-10-11 18:15:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:15:43,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-11 18:15:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:43,930 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:15:43,930 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 18:15:43,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:15:43,935 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:43,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 282 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:15:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 18:15:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 18:15:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 89 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2024-10-11 18:15:43,941 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 36 [2024-10-11 18:15:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:43,942 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2024-10-11 18:15:43,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-10-11 18:15:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:15:43,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:43,942 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:43,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:15:43,943 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1002008059, now seen corresponding path program 1 times [2024-10-11 18:15:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:43,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869095373] [2024-10-11 18:15:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:15:44,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869095373] [2024-10-11 18:15:44,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869095373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:44,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756039376] [2024-10-11 18:15:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:44,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:44,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:44,164 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:44,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:15:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:44,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 18:15:44,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:44,411 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-10-11 18:15:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:15:44,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:15:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756039376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:15:44,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-11 18:15:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853316938] [2024-10-11 18:15:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:44,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:15:44,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:44,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:15:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:15:44,488 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:44,598 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-10-11 18:15:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:15:44,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-11 18:15:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:44,599 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:15:44,599 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:15:44,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:15:44,600 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:44,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 263 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:15:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:15:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 85 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2024-10-11 18:15:44,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 36 [2024-10-11 18:15:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:44,603 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2024-10-11 18:15:44,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-10-11 18:15:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:15:44,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:44,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:44,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:15:44,805 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:44,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash -997467843, now seen corresponding path program 1 times [2024-10-11 18:15:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193066768] [2024-10-11 18:15:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:45,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:15:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193066768] [2024-10-11 18:15:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193066768] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859241121] [2024-10-11 18:15:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:45,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:45,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:45,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:15:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:45,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 18:15:45,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:45,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:15:45,772 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-10-11 18:15:45,806 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-11 18:15:45,807 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 23 treesize of output 24 [2024-10-11 18:15:45,829 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-10-11 18:15:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:45,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:15:45,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859241121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:45,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:15:45,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-10-11 18:15:45,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916395438] [2024-10-11 18:15:45,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:45,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:15:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:15:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2024-10-11 18:15:45,832 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:45,993 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-10-11 18:15:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:15:45,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-10-11 18:15:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:45,994 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:15:45,994 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:15:45,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2024-10-11 18:15:45,995 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:45,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 289 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 134 Unchecked, 0.1s Time] [2024-10-11 18:15:45,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:15:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 18:15:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-10-11 18:15:45,998 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37 [2024-10-11 18:15:45,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:45,998 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-10-11 18:15:45,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-10-11 18:15:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:15:45,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:45,999 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:46,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:15:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:15:46,200 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -997467842, now seen corresponding path program 1 times [2024-10-11 18:15:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837327099] [2024-10-11 18:15:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:46,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:46,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:46,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837327099] [2024-10-11 18:15:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837327099] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:46,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647289455] [2024-10-11 18:15:46,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:46,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:46,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:46,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:46,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:15:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:47,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-11 18:15:47,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:47,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:47,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:47,535 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:15:47,535 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 12 treesize of output 14 [2024-10-11 18:15:47,546 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:47,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:15:47,834 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 9 treesize of output 3 [2024-10-11 18:15:47,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:15:47,869 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-10-11 18:15:47,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:47,911 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:15:47,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-10-11 18:15:47,920 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:15:47,920 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 18:15:47,989 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-10-11 18:15:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-10-11 18:15:47,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:48,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647289455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:48,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:48,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 28 [2024-10-11 18:15:48,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728790084] [2024-10-11 18:15:48,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:48,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 18:15:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:48,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 18:15:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=839, Unknown=1, NotChecked=58, Total=992 [2024-10-11 18:15:48,137 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 29 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:15:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:49,018 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-10-11 18:15:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:15:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2024-10-11 18:15:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:49,020 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:15:49,020 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 18:15:49,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=1404, Unknown=1, NotChecked=76, Total=1640 [2024-10-11 18:15:49,022 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:49,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 801 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1157 Invalid, 0 Unknown, 95 Unchecked, 0.7s Time] [2024-10-11 18:15:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 18:15:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 18:15:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 88 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-10-11 18:15:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2024-10-11 18:15:49,026 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 37 [2024-10-11 18:15:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:49,026 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2024-10-11 18:15:49,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-11 18:15:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2024-10-11 18:15:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:15:49,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:49,027 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:49,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:49,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:49,229 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:49,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash -856726847, now seen corresponding path program 1 times [2024-10-11 18:15:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936895821] [2024-10-11 18:15:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:15:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:50,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936895821] [2024-10-11 18:15:50,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936895821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:50,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203701979] [2024-10-11 18:15:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:50,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:50,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:50,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:50,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:15:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:50,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 18:15:50,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:50,659 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 39 treesize of output 1 [2024-10-11 18:15:50,700 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-10-11 18:15:50,705 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:15:50,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:15:50,822 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_68| Int)) (and (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_68|) 0) (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_68| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_68|)) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_68| 1)))) is different from true [2024-10-11 18:15:50,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:50,834 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-10-11 18:15:50,867 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2024-10-11 18:15:50,867 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 40 treesize of output 69 [2024-10-11 18:15:50,975 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 62 treesize of output 42 [2024-10-11 18:15:50,981 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 25 [2024-10-11 18:15:51,027 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 31 treesize of output 13 [2024-10-11 18:15:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:15:51,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:15:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203701979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:15:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 29 [2024-10-11 18:15:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467455208] [2024-10-11 18:15:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:51,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:15:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:51,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:15:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=736, Unknown=1, NotChecked=54, Total=870 [2024-10-11 18:15:51,068 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 14 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:51,377 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-10-11 18:15:51,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:15:51,378 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 18:15:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:51,379 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:15:51,379 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:15:51,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=901, Unknown=1, NotChecked=60, Total=1056 [2024-10-11 18:15:51,380 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:51,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 373 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 336 Invalid, 0 Unknown, 123 Unchecked, 0.2s Time] [2024-10-11 18:15:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:15:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:15:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.5) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2024-10-11 18:15:51,383 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 38 [2024-10-11 18:15:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:51,383 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2024-10-11 18:15:51,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2024-10-11 18:15:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:15:51,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:51,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:15:51,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:51,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:51,586 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:51,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash -856726846, now seen corresponding path program 1 times [2024-10-11 18:15:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481656859] [2024-10-11 18:15:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:15:53,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:53,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481656859] [2024-10-11 18:15:53,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481656859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:53,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794956383] [2024-10-11 18:15:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:53,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:53,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:53,206 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:53,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:15:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:53,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-10-11 18:15:53,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:53,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:53,696 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-10-11 18:15:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:53,995 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-10-11 18:15:54,004 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:54,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:15:54,239 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 27 treesize of output 1 [2024-10-11 18:15:54,245 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 11 [2024-10-11 18:15:54,299 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 11 [2024-10-11 18:15:54,307 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:15:54,307 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-10-11 18:15:54,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:15:54,503 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_70| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_70| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_70|)) |c_#memory_$Pointer$#2.base|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_70| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_70|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_70|) 0) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_70| (select |c_#length| |v_node_create_~temp~0#1.base_70|)) |c_#length|)))) is different from true [2024-10-11 18:15:54,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:54,521 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 35 treesize of output 24 [2024-10-11 18:15:54,536 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2024-10-11 18:15:54,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:15:54,542 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 20 treesize of output 15 [2024-10-11 18:15:54,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-11 18:15:54,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-11 18:15:54,680 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-10-11 18:15:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 18:15:54,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:55,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794956383] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:55,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:55,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2024-10-11 18:15:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448062683] [2024-10-11 18:15:55,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:55,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 18:15:55,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:55,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 18:15:55,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1838, Unknown=1, NotChecked=86, Total=2070 [2024-10-11 18:15:55,051 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 42 states, 32 states have (on average 1.9375) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:15:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:56,634 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-10-11 18:15:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 18:15:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.9375) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2024-10-11 18:15:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:56,635 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:15:56,635 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:15:56,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=283, Invalid=3380, Unknown=1, NotChecked=118, Total=3782 [2024-10-11 18:15:56,637 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:56,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 859 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1082 Invalid, 0 Unknown, 97 Unchecked, 0.8s Time] [2024-10-11 18:15:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:15:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:15:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-10-11 18:15:56,640 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 38 [2024-10-11 18:15:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:56,641 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-10-11 18:15:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.9375) internal successors, (62), 35 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:15:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-10-11 18:15:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 18:15:56,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:56,642 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 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-10-11 18:15:56,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:56,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:56,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:56,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash 988829001, now seen corresponding path program 1 times [2024-10-11 18:15:56,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:56,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541662627] [2024-10-11 18:15:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:56,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:15:57,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541662627] [2024-10-11 18:15:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541662627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067615173] [2024-10-11 18:15:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:57,160 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:57,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:15:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:57,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:15:57,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:57,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:15:57,461 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-10-11 18:15:57,485 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-10-11 18:15:57,489 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-10-11 18:15:57,507 WARN L873 $PredicateComparison]: unable to prove that (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-10-11 18:15:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:57,532 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-10-11 18:15:57,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:15:57,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:15:57,573 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-10-11 18:15:57,593 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-10-11 18:15:57,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:57,616 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-10-11 18:15:57,663 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-10-11 18:15:57,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:15:57,693 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-10-11 18:15:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2024-10-11 18:15:57,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:15:57,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067615173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:57,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:15:57,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 17 [2024-10-11 18:15:57,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400283306] [2024-10-11 18:15:57,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:15:57,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:15:57,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:15:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=231, Unknown=2, NotChecked=62, Total=342 [2024-10-11 18:15:57,852 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:15:57,869 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 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|)))) (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-10-11 18:15:57,872 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 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|)))) (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-10-11 18:15:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:58,118 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-10-11 18:15:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:15:58,119 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-10-11 18:15:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:58,120 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:15:58,120 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:15:58,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=426, Unknown=4, NotChecked=180, Total=702 [2024-10-11 18:15:58,121 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:58,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 477 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 251 Unchecked, 0.2s Time] [2024-10-11 18:15:58,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:15:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 18:15:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-10-11 18:15:58,124 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 40 [2024-10-11 18:15:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:58,124 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-10-11 18:15:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 18:15:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-10-11 18:15:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:15:58,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:58,124 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 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-10-11 18:15:58,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:58,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:58,329 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1996438783, now seen corresponding path program 1 times [2024-10-11 18:15:58,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:58,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701473768] [2024-10-11 18:15:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:58,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 18:15:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701473768] [2024-10-11 18:15:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701473768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:58,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:58,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:15:58,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112495099] [2024-10-11 18:15:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:58,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:15:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:58,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:15:58,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:15:58,475 INFO L87 Difference]: Start difference. First operand 86 states and 91 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:58,591 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-10-11 18:15:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:15:58,592 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-11 18:15:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:58,592 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:15:58,593 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:15:58,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-10-11 18:15:58,593 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:58,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:15:58,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:15:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.423728813559322) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-10-11 18:15:58,600 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 43 [2024-10-11 18:15:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:58,601 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-10-11 18:15:58,601 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-10-11 18:15:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:15:58,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:58,602 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 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-10-11 18:15:58,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:15:58,602 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1996438784, now seen corresponding path program 1 times [2024-10-11 18:15:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388357057] [2024-10-11 18:15:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:15:58,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388357057] [2024-10-11 18:15:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388357057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:15:58,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556660884] [2024-10-11 18:15:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:15:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:15:58,958 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:15:58,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:15:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:15:59,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:15:59,290 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 23 treesize of output 15 [2024-10-11 18:15:59,292 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 28 treesize of output 16 [2024-10-11 18:15:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 18:15:59,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:15:59,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556660884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:59,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:15:59,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2024-10-11 18:15:59,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692604097] [2024-10-11 18:15:59,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:59,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:15:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:59,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:15:59,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:15:59,315 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:59,379 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-11 18:15:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:15:59,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-11 18:15:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:59,380 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:15:59,380 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:15:59,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:15:59,381 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:59,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:15:59,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:15:59,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-11 18:15:59,384 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 43 [2024-10-11 18:15:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:59,384 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-11 18:15:59,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:15:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-11 18:15:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 18:15:59,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:59,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-10-11 18:15:59,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 18:15:59,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 18:15:59,586 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:59,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash -795038422, now seen corresponding path program 1 times [2024-10-11 18:15:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:59,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886348910] [2024-10-11 18:15:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:59,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:15:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:15:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:15:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:15:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 18:15:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:15:59,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886348910] [2024-10-11 18:15:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886348910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:15:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:15:59,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:15:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560175511] [2024-10-11 18:15:59,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:15:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:15:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:15:59,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:15:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:15:59,818 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:15:59,950 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-10-11 18:15:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:15:59,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-10-11 18:15:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:15:59,951 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:15:59,951 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:15:59,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:15:59,952 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 35 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:15:59,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 208 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:15:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:15:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-10-11 18:15:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.4) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:15:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-10-11 18:15:59,955 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 46 [2024-10-11 18:15:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:15:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-10-11 18:15:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:15:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-10-11 18:15:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 18:15:59,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:15:59,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-10-11 18:15:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:15:59,957 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:15:59,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:15:59,957 INFO L85 PathProgramCache]: Analyzing trace with hash -795038421, now seen corresponding path program 1 times [2024-10-11 18:15:59,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:15:59,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328722369] [2024-10-11 18:15:59,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:15:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:15:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:16:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:00,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328722369] [2024-10-11 18:16:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328722369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:00,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490971379] [2024-10-11 18:16:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:00,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:00,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:00,753 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:00,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:16:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:01,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 18:16:01,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:01,052 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-10-11 18:16:01,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:01,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:16:01,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:16:01,284 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14|))) (and (<= .cse0 0) (<= 0 (+ .cse0 4)))))) is different from true [2024-10-11 18:16:01,326 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:16:01,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 18:16:01,330 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-10-11 18:16:01,589 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-10-11 18:16:01,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:01,598 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 40 treesize of output 32 [2024-10-11 18:16:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-10-11 18:16:01,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490971379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:01,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:01,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2024-10-11 18:16:01,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953487516] [2024-10-11 18:16:01,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:01,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:16:01,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:16:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=724, Unknown=1, NotChecked=54, Total=870 [2024-10-11 18:16:01,826 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 27 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:16:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:02,426 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-10-11 18:16:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:16:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2024-10-11 18:16:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:02,428 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:16:02,428 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:16:02,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=1185, Unknown=1, NotChecked=70, Total=1406 [2024-10-11 18:16:02,429 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:02,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 543 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 784 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2024-10-11 18:16:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:16:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-10-11 18:16:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 80 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:16:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-10-11 18:16:02,432 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 46 [2024-10-11 18:16:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:02,432 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-10-11 18:16:02,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 23 states have internal predecessors, (73), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:16:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-10-11 18:16:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 18:16:02,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:02,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 18:16:02,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:02,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:16:02,634 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:16:02,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1427073799, now seen corresponding path program 1 times [2024-10-11 18:16:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456640147] [2024-10-11 18:16:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:04,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:04,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:16:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:05,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456640147] [2024-10-11 18:16:05,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456640147] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959715416] [2024-10-11 18:16:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:05,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:05,243 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:05,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:16:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:05,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-10-11 18:16:05,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:05,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:05,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:16:06,042 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:16:06,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 18:16:06,164 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 23 treesize of output 11 [2024-10-11 18:16:06,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:16:06,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:16:06,324 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 27 treesize of output 1 [2024-10-11 18:16:06,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-10-11 18:16:06,399 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 14 [2024-10-11 18:16:06,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 18:16:06,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-10-11 18:16:06,672 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:16:06,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-11 18:16:06,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:06,688 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 27 [2024-10-11 18:16:06,708 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 18:16:06,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-11 18:16:07,047 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:07,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:16:07,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 16 [2024-10-11 18:16:07,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:16:07,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:16:07,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:16:07,427 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 15 [2024-10-11 18:16:07,499 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 11 [2024-10-11 18:16:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:16:07,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:16:07,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4571 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4570)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_4571))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2024-10-11 18:16:07,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4571 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4568) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4570)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) v_ArrVal_4571))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2024-10-11 18:16:08,182 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (v_ArrVal_4571 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#2| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) v_ArrVal_4568) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4570))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4571)))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2024-10-11 18:16:08,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4581 (Array Int Int)) (v_ArrVal_4570 (Array Int Int)) (v_ArrVal_4568 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26| Int) (v_ArrVal_4571 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#2| (select (select (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26| v_ArrVal_4581) .cse1) .cse2) v_ArrVal_4568) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26| v_ArrVal_4570))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4571)))) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26|) 0)))) is different from false [2024-10-11 18:16:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959715416] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:08,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:16:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 54 [2024-10-11 18:16:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137949052] [2024-10-11 18:16:08,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:16:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-11 18:16:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-11 18:16:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=3249, Unknown=43, NotChecked=476, Total=4032 [2024-10-11 18:16:08,239 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 54 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:16:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:09,737 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-10-11 18:16:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 18:16:09,738 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 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 50 [2024-10-11 18:16:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:09,739 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:16:09,739 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:16:09,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=435, Invalid=5390, Unknown=43, NotChecked=612, Total=6480 [2024-10-11 18:16:09,741 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 64 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:09,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 917 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:16:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:16:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-10-11 18:16:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:16:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-10-11 18:16:09,744 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 50 [2024-10-11 18:16:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:09,744 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-10-11 18:16:09,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:16:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-10-11 18:16:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 18:16:09,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:09,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 18:16:09,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:16:09,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:16:09,946 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:16:09,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1426978206, now seen corresponding path program 1 times [2024-10-11 18:16:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:09,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608259813] [2024-10-11 18:16:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:16:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 18:16:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608259813] [2024-10-11 18:16:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608259813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:10,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:16:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:16:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457710396] [2024-10-11 18:16:10,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:10,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:10,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:10,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:16:10,081 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:16:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:10,196 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-10-11 18:16:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:16:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-10-11 18:16:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:10,198 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:16:10,198 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:16:10,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:16:10,199 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:10,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 219 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:16:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:16:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 18:16:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:16:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-10-11 18:16:10,201 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 50 [2024-10-11 18:16:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:10,202 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-10-11 18:16:10,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:16:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-10-11 18:16:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 18:16:10,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:10,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 18:16:10,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:16:10,203 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:16:10,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1426978205, now seen corresponding path program 1 times [2024-10-11 18:16:10,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:10,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12573806] [2024-10-11 18:16:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:16:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:16:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12573806] [2024-10-11 18:16:10,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12573806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501689436] [2024-10-11 18:16:10,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:10,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:10,514 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:10,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:16:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:10,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:16:10,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:11,019 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 23 treesize of output 15 [2024-10-11 18:16:11,021 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 28 treesize of output 16 [2024-10-11 18:16:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:16:11,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:16:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501689436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:16:11,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:16:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2024-10-11 18:16:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722903997] [2024-10-11 18:16:11,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:16:11,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:16:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:16:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:16:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:16:11,043 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:15,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:16:19,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 18:16:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:16:19,195 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-10-11 18:16:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:16:19,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-10-11 18:16:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:16:19,196 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:16:19,197 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:16:19,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:16:19,198 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 65 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:16:19,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 213 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2024-10-11 18:16:19,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:16:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 18:16:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:16:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-11 18:16:19,201 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 50 [2024-10-11 18:16:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:16:19,201 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-11 18:16:19,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 18:16:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-11 18:16:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 18:16:19,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:16:19,202 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 18:16:19,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 18:16:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:16:19,403 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2024-10-11 18:16:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:16:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1231485752, now seen corresponding path program 1 times [2024-10-11 18:16:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:16:19,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127868974] [2024-10-11 18:16:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:16:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:16:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 18:16:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 18:16:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:16:21,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:16:21,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127868974] [2024-10-11 18:16:21,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127868974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:16:21,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898289757] [2024-10-11 18:16:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:16:21,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:21,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:16:21,856 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:16:21,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 18:16:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:16:22,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-11 18:16:22,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:16:22,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:16:22,328 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 39 treesize of output 1 [2024-10-11 18:16:22,376 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-10-11 18:16:22,380 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:16:22,380 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-10-11 18:16:26,531 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (let ((.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)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2)) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= 0 (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |c_#memory_$Pointer$#2.base|))) (and (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))))) is different from false [2024-10-11 18:16:26,535 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 1) (let ((.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)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2)) 1) (= 0 (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= 0 (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |c_#memory_$Pointer$#2.base|))) (and (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| .cse4) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))))) is different from true [2024-10-11 18:16:30,576 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.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)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |c_#memory_$Pointer$#2.base|))) (and (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2)) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-10-11 18:16:30,580 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.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)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |c_#memory_$Pointer$#2.base|))) (and (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse3) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|)))))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2)) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-10-11 18:16:30,739 INFO L349 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2024-10-11 18:16:30,740 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 31 treesize of output 48 [2024-10-11 18:16:34,812 WARN L851 $PredicateComparison]: unable to prove that (and (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|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse6))) (or (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse2) .cse6)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse5 (select |v_#memory_$Pointer$#2.base_203| .cse5)) |v_#memory_$Pointer$#2.base_203|)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-10-11 18:16:34,815 WARN L873 $PredicateComparison]: unable to prove that (and (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|)) (.cse6 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse2) .cse6))) (or (and (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int)) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1)))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1))) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse2) .cse6)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse5 (select |v_#memory_$Pointer$#2.base_203| .cse5)) |v_#memory_$Pointer$#2.base_203|)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 1)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-10-11 18:16:34,895 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:16:34,896 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-10-11 18:16:34,900 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-10-11 18:16:34,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:34,920 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 18:16:34,920 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 35 treesize of output 37 [2024-10-11 18:16:34,936 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-10-11 18:16:38,940 WARN L851 $PredicateComparison]: unable to prove that (and (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))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (or (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse0 (select |v_#memory_$Pointer$#2.base_203| .cse0)) |v_#memory_$Pointer$#2.base_203|) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-10-11 18:16:38,944 WARN L873 $PredicateComparison]: unable to prove that (and (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))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (or (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse0 (select |v_#memory_$Pointer$#2.base_203| .cse0)) |v_#memory_$Pointer$#2.base_203|) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-10-11 18:16:39,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:16:39,034 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-10-11 18:16:39,087 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:16:39,088 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 34 treesize of output 37 [2024-10-11 18:16:43,176 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|))) (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))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (or (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse0 (select |v_#memory_$Pointer$#2.base_203| .cse0)) |v_#memory_$Pointer$#2.base_203|) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from false [2024-10-11 18:16:43,180 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int)) (= |c_ULTIMATE.start_dll_circular_append_#t~mem14#1.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|))) (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))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (or (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse0 (select |v_#memory_$Pointer$#2.base_203| .cse0)) |v_#memory_$Pointer$#2.base_203|) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (and (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse6 (select |c_#valid| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1))) (or (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse5) (= |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| .cse1)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 1)) is different from true [2024-10-11 18:16:43,221 INFO L349 Elim1Store]: treesize reduction 49, result has 43.0 percent of original size [2024-10-11 18:16:43,221 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 77 treesize of output 69 [2024-10-11 18:16:43,275 INFO L349 Elim1Store]: treesize reduction 49, result has 43.0 percent of original size [2024-10-11 18:16:43,275 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 51 treesize of output 43 [2024-10-11 18:16:43,434 WARN L851 $PredicateComparison]: unable to prove that (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))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (or (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6))) (and (= (select |c_#valid| .cse0) 1) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse3 (select |v_#memory_$Pointer$#2.base_203| .cse3)) |v_#memory_$Pointer$#2.base_203|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 0) (= (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| .cse0)) .cse0 v_DerPreprocessor_14))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 .cse0))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse7 (select |c_#valid| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= .cse3 .cse0)))))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4)))) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse8) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse9 (select |c_#valid| .cse9)))) (= .cse8 .cse10) (= (select |c_#valid| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4)))) (and (= (select |c_#valid| .cse11) 1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| .cse11) 0) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse12 (select |c_#valid| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_115 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse15) .cse2))) (and (= (select |c_#valid| .cse13) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse13) 0) (= |c_#valid| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse14 (select |c_#valid| .cse14)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_115) 1) (= .cse15 .cse1)))))))) is different from false [2024-10-11 18:16:43,440 WARN L873 $PredicateComparison]: unable to prove that (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))) (let ((.cse10 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2))) (or (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|)) (.cse6 (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse6))) (and (= (select |c_#valid| .cse0) 1) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|))) (and (= (select |v_old(#valid)_AFTER_CALL_49| (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse1) .cse2)) 1) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse3 (select |v_#memory_$Pointer$#2.base_203| .cse3)) |v_#memory_$Pointer$#2.base_203|) (= (select |v_old(#valid)_AFTER_CALL_49| .cse0) 0) (= (let ((.cse4 (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| .cse0)) .cse0 v_DerPreprocessor_14))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 .cse0))) |c_#memory_$Pointer$#2.base|) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse7 (select |c_#valid| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= .cse3 .cse0)))))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4)))) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse8) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse9 (select |c_#valid| .cse9)))) (= .cse8 .cse10) (= (select |c_#valid| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int)) (let ((.cse11 (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|)) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4)))) (and (= (select |c_#valid| .cse11) 1) (exists ((|v_old(#valid)_AFTER_CALL_49| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_49| .cse11) 0) (= |c_#valid| (let ((.cse12 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse12 (select |c_#valid| .cse12)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse10) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1)))))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.offset_22| Int) (|v_ULTIMATE.start_dll_circular_append_~head#1.base_27| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_115 Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_append_~head#1.base_27|) |v_ULTIMATE.start_dll_circular_append_~head#1.offset_22|))) (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| .cse15) .cse2))) (and (= (select |c_#valid| .cse13) 1) (= (select |v_old(#valid)_AFTER_CALL_49| .cse13) 0) (= |c_#valid| (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse14 (select |c_#valid| .cse14)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_115) 1) (= .cse15 .cse1)))))))) is different from true [2024-10-11 18:16:44,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:16:44,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 431 treesize of output 443 [2024-10-11 18:16:44,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 303 [2024-10-11 18:16:44,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_main_#t~mem20#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem20#1.base|) .cse11))) (or (and (exists ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_115 Int)) (and (= (select v_prenex_20 .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff v_prenex_20 |c_#valid|))) (store v_prenex_20 .cse1 (select |c_#valid| .cse1)))) (= (select v_prenex_20 |c_ULTIMATE.start_main_#t~mem20#1.base|) 1) (= (select v_prenex_20 v_arrayElimCell_115) 1))) (= (select |c_#valid| .cse0) 1)) (exists ((v_arrayElimCell_120 Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_120) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4)))) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_main_#t~mem20#1.base|) 1) (= .cse0 .cse2)))) (exists ((v_prenex_28 Int) (v_arrayElimCell_116 Int) (v_prenex_27 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_116) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse4 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_27 .cse5) 0) (= (select |c_#valid| .cse5) 1) (= (select v_prenex_27 .cse0) 1) (= 1 (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem20#1.base|))))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_prenex_23 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_117 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (+ v_prenex_23 4))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_117) .cse10))) (and (= |c_#valid| (let ((.cse6 (@diff v_prenex_24 |c_#valid|))) (store v_prenex_24 .cse6 (select |c_#valid| .cse6)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse7 (select |v_#memory_$Pointer$#2.base_203| .cse7)) |v_#memory_$Pointer$#2.base_203|) (= (select v_prenex_24 .cse8) 0) (= (let ((.cse9 (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| .cse8)) .cse8 v_DerPreprocessor_14))) (store .cse9 v_arrayElimCell_117 (store (select .cse9 v_arrayElimCell_117) .cse10 .cse8))) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_24 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |c_ULTIMATE.start_main_#t~mem20#1.base|) .cse11)) 1) (= .cse8 .cse7) (= (select |c_#valid| .cse8) 1) (= 1 (select v_prenex_24 |c_ULTIMATE.start_main_#t~mem20#1.base|))))))))) is different from false [2024-10-11 18:16:44,523 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_main_#t~mem20#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem20#1.base|) .cse11))) (or (and (exists ((v_prenex_20 (Array Int Int)) (v_arrayElimCell_115 Int)) (and (= (select v_prenex_20 .cse0) 0) (= |c_#valid| (let ((.cse1 (@diff v_prenex_20 |c_#valid|))) (store v_prenex_20 .cse1 (select |c_#valid| .cse1)))) (= (select v_prenex_20 |c_ULTIMATE.start_main_#t~mem20#1.base|) 1) (= (select v_prenex_20 v_arrayElimCell_115) 1))) (= (select |c_#valid| .cse0) 1)) (exists ((v_arrayElimCell_120 Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| Int) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (v_arrayElimCell_106 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_120) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_20| 4)))) (and (= (select |v_old(#valid)_AFTER_CALL_49| v_arrayElimCell_106) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_49| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_49| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_49| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_49| |c_ULTIMATE.start_main_#t~mem20#1.base|) 1) (= .cse0 .cse2)))) (exists ((v_prenex_28 Int) (v_arrayElimCell_116 Int) (v_prenex_27 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_116) (+ v_prenex_28 4)))) (and (= |c_#valid| (let ((.cse4 (@diff v_prenex_27 |c_#valid|))) (store v_prenex_27 .cse4 (select |c_#valid| .cse4)))) (= (select v_prenex_27 .cse5) 0) (= (select |c_#valid| .cse5) 1) (= (select v_prenex_27 .cse0) 1) (= 1 (select v_prenex_27 |c_ULTIMATE.start_main_#t~mem20#1.base|))))) (exists ((|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_prenex_23 Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (|v_#memory_$Pointer$#2.base_203| (Array Int (Array Int Int))) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_117 Int) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse10 (+ v_prenex_23 4))) (let ((.cse7 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |v_#memory_$Pointer$#2.base_203|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_117) .cse10))) (and (= |c_#valid| (let ((.cse6 (@diff v_prenex_24 |c_#valid|))) (store v_prenex_24 .cse6 (select |c_#valid| .cse6)))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| .cse7 (select |v_#memory_$Pointer$#2.base_203| .cse7)) |v_#memory_$Pointer$#2.base_203|) (= (select v_prenex_24 .cse8) 0) (= (let ((.cse9 (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| .cse8)) .cse8 v_DerPreprocessor_14))) (store .cse9 v_arrayElimCell_117 (store (select .cse9 v_arrayElimCell_117) .cse10 .cse8))) |c_#memory_$Pointer$#2.base|) (= (select v_prenex_24 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_49| |c_ULTIMATE.start_main_#t~mem20#1.base|) .cse11)) 1) (= .cse8 .cse7) (= (select |c_#valid| .cse8) 1) (= 1 (select v_prenex_24 |c_ULTIMATE.start_main_#t~mem20#1.base|))))))))) is different from true [2024-10-11 18:16:44,544 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 18:16:44,545 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 47 treesize of output 17 [2024-10-11 18:16:44,564 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-10-11 18:16:44,564 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 43 treesize of output 28 [2024-10-11 18:16:44,575 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-11 18:16:44,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-11 18:16:44,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:16:44,777 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Complicated and unsupported kind of self-update: (let ((.cse0 (select (select |#memory_$Pointer$#2.base| v_arrayElimCell_117) (+ v_prenex_23 4)))) (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| .cse0)) .cse0 v_DerPreprocessor_14)) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:205) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:104) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 18:16:44,781 INFO L158 Benchmark]: Toolchain (without parser) took 75579.55ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 108.4MB in the beginning and 199.5MB in the end (delta: -91.0MB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. [2024-10-11 18:16:44,781 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:16:44,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.11ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 125.2MB in the end (delta: -17.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:16:44,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.03ms. Allocated memory is still 167.8MB. Free memory was 125.2MB in the beginning and 123.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:16:44,782 INFO L158 Benchmark]: Boogie Preprocessor took 77.39ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 118.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 18:16:44,782 INFO L158 Benchmark]: RCFGBuilder took 768.18ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 84.1MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 18:16:44,782 INFO L158 Benchmark]: TraceAbstraction took 74134.54ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 83.2MB in the beginning and 199.5MB in the end (delta: -116.2MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. [2024-10-11 18:16:44,783 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.11ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 125.2MB in the end (delta: -17.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.03ms. Allocated memory is still 167.8MB. Free memory was 125.2MB in the beginning and 123.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.39ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 118.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 768.18ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 84.1MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 74134.54ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 83.2MB in the beginning and 199.5MB in the end (delta: -116.2MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Complicated and unsupported kind of self-update: (let ((.cse0 (select (select |#memory_$Pointer$#2.base| v_arrayElimCell_117) (+ v_prenex_23 4)))) (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| .cse0)) .cse0 v_DerPreprocessor_14)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Complicated and unsupported kind of self-update: (let ((.cse0 (select (select |#memory_$Pointer$#2.base| v_arrayElimCell_117) (+ v_prenex_23 4)))) (store (store |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |v_#memory_$Pointer$#2.base_203| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| .cse0)) .cse0 v_DerPreprocessor_14)): de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.classify(DerPreprocessor.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-11 18:16:44,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...