./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/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:13:51,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:13:51,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:13:51,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:13:51,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:13:51,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:13:51,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:13:51,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:13:51,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:13:51,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:13:51,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:13:51,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:13:51,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:13:51,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:13:51,360 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:13:51,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:13:51,361 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:13:51,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:13:51,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:13:51,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:13:51,361 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:13:51,365 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:13:51,365 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:13:51,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:13:51,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:13:51,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:13:51,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:13:51,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:13:51,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:13:51,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:13:51,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:13:51,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:13:51,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:13:51,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:13:51,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:13:51,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:13:51,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:13:51,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:13:51,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:13:51,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:13:51,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:13:51,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:13:51,370 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-10-14 18:13:51,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:13:51,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:13:51,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:13:51,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:13:51,573 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:13:51,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-14 18:13:52,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:13:53,059 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:13:53,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-10-14 18:13:53,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0888420be/e41d7e6b67dd41619200d3842126348a/FLAG35225020c [2024-10-14 18:13:53,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0888420be/e41d7e6b67dd41619200d3842126348a [2024-10-14 18:13:53,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:13:53,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:13:53,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:13:53,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:13:53,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:13:53,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34fda63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53, skipping insertion in model container [2024-10-14 18:13:53,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:13:53,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:13:53,424 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:13:53,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:13:53,480 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:13:53,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53 WrapperNode [2024-10-14 18:13:53,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:13:53,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:13:53,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:13:53,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:13:53,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,521 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 129 [2024-10-14 18:13:53,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:13:53,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:13:53,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:13:53,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:13:53,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,547 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 13, 6]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2024-10-14 18:13:53,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:13:53,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:13:53,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:13:53,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:13:53,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (1/1) ... [2024-10-14 18:13:53,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:13:53,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:53,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:13:53,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:13:53,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 18:13:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 18:13:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 18:13:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-14 18:13:53,648 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 18:13:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:13:53,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:13:53,778 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:13:53,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:13:54,072 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-14 18:13:54,072 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:13:54,117 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:13:54,117 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 18:13:54,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:13:54 BoogieIcfgContainer [2024-10-14 18:13:54,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:13:54,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:13:54,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:13:54,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:13:54,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:13:53" (1/3) ... [2024-10-14 18:13:54,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c194767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:13:54, skipping insertion in model container [2024-10-14 18:13:54,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:13:53" (2/3) ... [2024-10-14 18:13:54,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c194767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:13:54, skipping insertion in model container [2024-10-14 18:13:54,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:13:54" (3/3) ... [2024-10-14 18:13:54,125 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-10-14 18:13:54,140 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:13:54,140 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-14 18:13:54,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:13:54,185 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;@5156ec0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:13:54,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2024-10-14 18:13:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 44 states have (on average 2.25) internal successors, (99), 85 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 18:13:54,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:54,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 18:13:54,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1904486370, now seen corresponding path program 1 times [2024-10-14 18:13:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095894876] [2024-10-14 18:13:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:54,358 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-14 18:13:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095894876] [2024-10-14 18:13:54,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095894876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:54,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:54,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:13:54,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737137397] [2024-10-14 18:13:54,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:54,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:13:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:13:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:13:54,388 INFO L87 Difference]: Start difference. First operand has 89 states, 44 states have (on average 2.25) internal successors, (99), 85 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 18:13:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:54,487 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-10-14 18:13:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:13:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-14 18:13:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:54,496 INFO L225 Difference]: With dead ends: 85 [2024-10-14 18:13:54,496 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 18:13:54,497 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-14 18:13:54,501 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:54,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 18:13:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 18:13:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 79 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-10-14 18:13:54,537 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 6 [2024-10-14 18:13:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-10-14 18:13:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 18:13:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-10-14 18:13:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 18:13:54,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:54,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 18:13:54,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:13:54,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1904486371, now seen corresponding path program 1 times [2024-10-14 18:13:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140013834] [2024-10-14 18:13:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:54,675 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-14 18:13:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:54,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140013834] [2024-10-14 18:13:54,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140013834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:54,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:13:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545635590] [2024-10-14 18:13:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:13:54,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:54,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:13:54,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:13:54,678 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 18:13:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:54,736 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2024-10-14 18:13:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:13:54,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-10-14 18:13:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:54,737 INFO L225 Difference]: With dead ends: 80 [2024-10-14 18:13:54,737 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 18:13:54,737 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-14 18:13:54,738 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:54,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 18:13:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 18:13:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-10-14 18:13:54,744 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 6 [2024-10-14 18:13:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:54,744 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-10-14 18:13:54,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-14 18:13:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-10-14 18:13:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:13:54,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:54,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:54,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:13:54,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash -143040805, now seen corresponding path program 1 times [2024-10-14 18:13:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522382791] [2024-10-14 18:13:54,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,006 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-14 18:13:55,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522382791] [2024-10-14 18:13:55,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522382791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:55,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:55,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:13:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819942791] [2024-10-14 18:13:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:55,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:13:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:13:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:55,013 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-14 18:13:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:55,211 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-10-14 18:13:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:55,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-14 18:13:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:55,212 INFO L225 Difference]: With dead ends: 78 [2024-10-14 18:13:55,212 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:13:55,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-14 18:13:55,213 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:55,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 261 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:55,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:13:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 18:13:55,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-10-14 18:13:55,224 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 11 [2024-10-14 18:13:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:55,226 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-10-14 18:13:55,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-14 18:13:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-10-14 18:13:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 18:13:55,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:55,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:55,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:13:55,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash -143040806, now seen corresponding path program 1 times [2024-10-14 18:13:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:55,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466247054] [2024-10-14 18:13:55,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,363 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-14 18:13:55,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:55,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466247054] [2024-10-14 18:13:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466247054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:55,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:55,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:13:55,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008903016] [2024-10-14 18:13:55,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:55,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:13:55,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:13:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:13:55,365 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-14 18:13:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:55,543 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-10-14 18:13:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:13:55,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-14 18:13:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:55,545 INFO L225 Difference]: With dead ends: 76 [2024-10-14 18:13:55,545 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 18:13:55,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-14 18:13:55,547 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:55,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 245 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 18:13:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 18:13:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.880952380952381) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-10-14 18:13:55,556 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 11 [2024-10-14 18:13:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:55,557 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-10-14 18:13:55,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 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-14 18:13:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-10-14 18:13:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:13:55,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:55,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:55,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:13:55,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:55,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash 532708326, now seen corresponding path program 1 times [2024-10-14 18:13:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:55,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924206013] [2024-10-14 18:13:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 18:13:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,626 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-14 18:13:55,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:55,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924206013] [2024-10-14 18:13:55,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924206013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:55,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:55,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:13:55,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809078356] [2024-10-14 18:13:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:55,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:13:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:13:55,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:13:55,630 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-14 18:13:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:55,728 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-10-14 18:13:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:13:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-10-14 18:13:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:55,729 INFO L225 Difference]: With dead ends: 86 [2024-10-14 18:13:55,729 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 18:13:55,729 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-14 18:13:55,730 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:55,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 167 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 18:13:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2024-10-14 18:13:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:13:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-10-14 18:13:55,742 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 12 [2024-10-14 18:13:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:55,751 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-10-14 18:13:55,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-14 18:13:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-10-14 18:13:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 18:13:55,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:55,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:55,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:13:55,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:55,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash -721106662, now seen corresponding path program 1 times [2024-10-14 18:13:55,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:55,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081302646] [2024-10-14 18:13:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:55,886 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-14 18:13:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:55,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081302646] [2024-10-14 18:13:55,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081302646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:13:55,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:13:55,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:13:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508337060] [2024-10-14 18:13:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:13:55,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:13:55,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:13:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:13:55,889 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 18:13:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:56,007 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-14 18:13:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:13:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-14 18:13:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:56,009 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:13:56,009 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:13:56,009 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-14 18:13:56,010 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 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-14 18:13:56,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:13:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 18:13:56,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 77 states have internal predecessors, (84), 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-14 18:13:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-14 18:13:56,015 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 14 [2024-10-14 18:13:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:56,015 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-14 18:13:56,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 18:13:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-14 18:13:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:13:56,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:56,016 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-14 18:13:56,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 18:13:56,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:56,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1413657028, now seen corresponding path program 1 times [2024-10-14 18:13:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968351747] [2024-10-14 18:13:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 18:13:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,102 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-14 18:13:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968351747] [2024-10-14 18:13:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968351747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131266876] [2024-10-14 18:13:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:56,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:56,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 18:13:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:13:56,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:13:56,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:56,257 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-14 18:13:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131266876] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:13:56,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:13:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-14 18:13:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795699377] [2024-10-14 18:13:56,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:13:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:56,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:13:56,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:13:56,260 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:56,330 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-10-14 18:13:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:13:56,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-14 18:13:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:56,331 INFO L225 Difference]: With dead ends: 84 [2024-10-14 18:13:56,331 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 18:13:56,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:13:56,332 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:56,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 226 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 18:13:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 18:13:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 79 states have internal predecessors, (86), 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-14 18:13:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-10-14 18:13:56,336 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 25 [2024-10-14 18:13:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:56,336 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-10-14 18:13:56,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:13:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-10-14 18:13:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:13:56,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:56,337 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:13:56,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 18:13:56,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:56,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:56,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash -237961352, now seen corresponding path program 1 times [2024-10-14 18:13:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473939777] [2024-10-14 18:13:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:13:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473939777] [2024-10-14 18:13:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473939777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651881592] [2024-10-14 18:13:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:56,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:56,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:56,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 18:13:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:56,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 18:13:56,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:57,048 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:13:57,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-14 18:13:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:13:57,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:13:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651881592] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:13:57,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:13:57,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-10-14 18:13:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037133348] [2024-10-14 18:13:57,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:57,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 18:13:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 18:13:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-14 18:13:57,319 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 20 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 18:13:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:57,618 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2024-10-14 18:13:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:13:57,619 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2024-10-14 18:13:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:57,620 INFO L225 Difference]: With dead ends: 83 [2024-10-14 18:13:57,620 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 18:13:57,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2024-10-14 18:13:57,620 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:57,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 437 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:13:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 18:13:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 18:13:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 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-14 18:13:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2024-10-14 18:13:57,624 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 27 [2024-10-14 18:13:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2024-10-14 18:13:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 18:13:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2024-10-14 18:13:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:13:57,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:57,625 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:13:57,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 18:13:57,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 18:13:57,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash -237961351, now seen corresponding path program 1 times [2024-10-14 18:13:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:57,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467117475] [2024-10-14 18:13:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:13:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:58,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467117475] [2024-10-14 18:13:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467117475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075337257] [2024-10-14 18:13:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:58,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:58,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:58,128 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:58,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 18:13:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:58,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 18:13:58,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:58,258 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-14 18:13:58,369 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:13:58,370 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-14 18:13:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:13:58,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075337257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:58,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:13:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2024-10-14 18:13:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694843349] [2024-10-14 18:13:58,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:58,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:13:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:58,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:13:58,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-14 18:13:58,477 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 17 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:13:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:58,788 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-14 18:13:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:13:58,788 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-14 18:13:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:58,789 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:13:58,789 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:13:58,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-10-14 18:13:58,790 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 3 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:58,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 554 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:13:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:13:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 18:13:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 77 states have internal predecessors, (84), 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-14 18:13:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-14 18:13:58,793 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 27 [2024-10-14 18:13:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:58,793 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-14 18:13:58,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:13:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-14 18:13:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 18:13:58,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:58,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:58,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:13:58,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:58,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:58,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash -871140186, now seen corresponding path program 2 times [2024-10-14 18:13:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:58,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905824567] [2024-10-14 18:13:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:13:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 18:13:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:13:59,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:13:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905824567] [2024-10-14 18:13:59,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905824567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:13:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046522309] [2024-10-14 18:13:59,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:13:59,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:59,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:13:59,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:13:59,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 18:13:59,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:13:59,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:13:59,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 18:13:59,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:13:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:13:59,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:13:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:13:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046522309] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:13:59,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:13:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2024-10-14 18:13:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960779857] [2024-10-14 18:13:59,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:13:59,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:13:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:13:59,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:13:59,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:13:59,364 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:13:59,509 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2024-10-14 18:13:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:13:59,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-10-14 18:13:59,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:13:59,510 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:13:59,510 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:13:59,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:13:59,511 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 4 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:13:59,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 405 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:13:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:13:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 18:13:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.6938775510204083) internal successors, (83), 77 states have internal predecessors, (83), 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-14 18:13:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-10-14 18:13:59,520 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 38 [2024-10-14 18:13:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:13:59,520 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-10-14 18:13:59,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:13:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-10-14 18:13:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:13:59,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:13:59,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:13:59,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 18:13:59,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:13:59,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:13:59,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:13:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1657850760, now seen corresponding path program 1 times [2024-10-14 18:13:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:13:59,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987689798] [2024-10-14 18:13:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:13:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:13:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:13:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:13:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:00,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:14:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987689798] [2024-10-14 18:14:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987689798] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091365883] [2024-10-14 18:14:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:00,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:00,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:00,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:00,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 18:14:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:00,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 18:14:00,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:00,330 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-14 18:14:00,344 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-14 18:14:00,362 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-14 18:14:00,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:00,395 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-14 18:14:00,412 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-14 18:14:00,460 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:14:00,460 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-14 18:14:00,505 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:14:00,506 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-14 18:14:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 10 not checked. [2024-10-14 18:14:00,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:00,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091365883] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:00,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:14:00,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2024-10-14 18:14:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828704538] [2024-10-14 18:14:00,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:00,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 18:14:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 18:14:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2024-10-14 18:14:00,747 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 13 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 18:14:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:01,028 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-10-14 18:14:01,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:01,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-10-14 18:14:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:01,030 INFO L225 Difference]: With dead ends: 88 [2024-10-14 18:14:01,030 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 18:14:01,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-10-14 18:14:01,030 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 58 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:01,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 235 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 311 Invalid, 0 Unknown, 166 Unchecked, 0.2s Time] [2024-10-14 18:14:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 18:14:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2024-10-14 18:14:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 72 states have internal predecessors, (78), 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-14 18:14:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-10-14 18:14:01,033 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 39 [2024-10-14 18:14:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:01,034 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-10-14 18:14:01,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 18:14:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-10-14 18:14:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 18:14:01,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:01,035 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:01,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 18:14:01,235 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:01,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1657850759, now seen corresponding path program 1 times [2024-10-14 18:14:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550237308] [2024-10-14 18:14:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:01,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 18:14:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550237308] [2024-10-14 18:14:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550237308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003419156] [2024-10-14 18:14:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:01,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:01,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:01,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 18:14:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:01,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 18:14:01,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:01,801 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-14 18:14:01,824 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-14 18:14:01,839 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-14 18:14:01,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:01,864 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-14 18:14:01,897 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-14 18:14:01,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:01,928 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-14 18:14:02,010 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-14 18:14:02,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:02,041 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-14 18:14:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 18:14:02,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:02,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003419156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:02,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:02,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2024-10-14 18:14:02,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056248949] [2024-10-14 18:14:02,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:02,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:14:02,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:02,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:14:02,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:14:02,059 INFO L87 Difference]: Start difference. First operand 77 states and 84 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:02,149 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-10-14 18:14:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:02,149 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-14 18:14:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:02,150 INFO L225 Difference]: With dead ends: 74 [2024-10-14 18:14:02,150 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 18:14:02,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 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-14 18:14:02,150 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:02,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 157 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2024-10-14 18:14:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 18:14:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-14 18:14:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.530612244897959) internal successors, (75), 69 states have internal predecessors, (75), 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-14 18:14:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-10-14 18:14:02,156 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 39 [2024-10-14 18:14:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:02,157 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-10-14 18:14:02,157 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-10-14 18:14:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:14:02,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:02,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:02,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:02,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:02,358 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:02,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1203032295, now seen corresponding path program 1 times [2024-10-14 18:14:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:02,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974040864] [2024-10-14 18:14:02,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:02,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:14:02,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974040864] [2024-10-14 18:14:02,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974040864] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899966377] [2024-10-14 18:14:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:02,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:02,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:02,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:02,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 18:14:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:02,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 18:14:02,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:02,966 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-14 18:14:02,984 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-14 18:14:03,013 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-14 18:14:03,014 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-14 18:14:03,032 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-14 18:14:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:14:03,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899966377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:03,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-10-14 18:14:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330938878] [2024-10-14 18:14:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:03,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:14:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:14:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2024-10-14 18:14:03,035 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:03,128 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2024-10-14 18:14:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:14:03,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2024-10-14 18:14:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:03,129 INFO L225 Difference]: With dead ends: 73 [2024-10-14 18:14:03,129 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 18:14:03,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=262, Unknown=1, NotChecked=32, Total=342 [2024-10-14 18:14:03,130 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:03,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 182 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2024-10-14 18:14:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 18:14:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 18:14:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 68 states have internal predecessors, (75), 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-14 18:14:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-10-14 18:14:03,133 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 42 [2024-10-14 18:14:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:03,133 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-10-14 18:14:03,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-10-14 18:14:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:14:03,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:03,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:03,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:03,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:03,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:03,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1203032294, now seen corresponding path program 1 times [2024-10-14 18:14:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039633071] [2024-10-14 18:14:03,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:14:03,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:03,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039633071] [2024-10-14 18:14:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039633071] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:03,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332109813] [2024-10-14 18:14:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:03,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:03,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:03,859 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:03,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 18:14:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:04,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 18:14:04,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:04,451 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-14 18:14:04,673 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-14 18:14:04,675 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-14 18:14:04,706 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_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2024-10-14 18:14:04,755 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:14:04,755 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-14 18:14:04,759 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-14 18:14:04,812 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-14 18:14:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2024-10-14 18:14:04,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:04,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332109813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:04,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:14:04,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2024-10-14 18:14:04,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699625422] [2024-10-14 18:14:04,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:04,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 18:14:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:04,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 18:14:04,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=676, Unknown=1, NotChecked=52, Total=812 [2024-10-14 18:14:04,958 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 26 states, 20 states have (on average 3.25) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:14:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:05,494 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-10-14 18:14:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:14:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 3.25) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2024-10-14 18:14:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:05,495 INFO L225 Difference]: With dead ends: 85 [2024-10-14 18:14:05,495 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 18:14:05,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1193, Unknown=1, NotChecked=70, Total=1406 [2024-10-14 18:14:05,496 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 56 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:05,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 522 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 698 Invalid, 0 Unknown, 82 Unchecked, 0.3s Time] [2024-10-14 18:14:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 18:14:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-10-14 18:14:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 76 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-14 18:14:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-10-14 18:14:05,499 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 42 [2024-10-14 18:14:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:05,500 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-10-14 18:14:05,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 3.25) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:14:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-10-14 18:14:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 18:14:05,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:05,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:05,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 18:14:05,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 18:14:05,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:05,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1360419867, now seen corresponding path program 1 times [2024-10-14 18:14:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:05,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042198915] [2024-10-14 18:14:05,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:06,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:14:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042198915] [2024-10-14 18:14:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042198915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787486470] [2024-10-14 18:14:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:06,174 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:06,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 18:14:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:06,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 18:14:06,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:06,358 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-14 18:14:06,381 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-14 18:14:06,402 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-14 18:14:06,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:06,419 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-14 18:14:06,449 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-14 18:14:06,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:06,467 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-14 18:14:06,504 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-14 18:14:06,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:06,530 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-14 18:14:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 18:14:06,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787486470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 14 [2024-10-14 18:14:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632252592] [2024-10-14 18:14:06,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:06,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:14:06,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:14:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:14:06,555 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:14:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:06,608 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2024-10-14 18:14:06,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:14:06,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-10-14 18:14:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:06,609 INFO L225 Difference]: With dead ends: 80 [2024-10-14 18:14:06,609 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 18:14:06,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-10-14 18:14:06,610 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:06,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 113 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 84 Unchecked, 0.0s Time] [2024-10-14 18:14:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 18:14:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 18:14:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.396551724137931) internal successors, (81), 74 states have internal predecessors, (81), 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-14 18:14:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-10-14 18:14:06,615 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 43 [2024-10-14 18:14:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:06,615 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-10-14 18:14:06,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:14:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-10-14 18:14:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 18:14:06,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:06,617 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:06,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:06,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 18:14:06,818 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:06,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1967022405, now seen corresponding path program 1 times [2024-10-14 18:14:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:06,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738983378] [2024-10-14 18:14:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:07,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:07,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738983378] [2024-10-14 18:14:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738983378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095186717] [2024-10-14 18:14:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:07,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:07,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:07,786 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:07,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 18:14:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:07,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-14 18:14:07,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:08,126 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:14:08,126 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-14 18:14:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:14:08,257 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:14:08,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-14 18:14:08,370 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-14 18:14:08,373 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-14 18:14:08,509 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_75| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_75| 1)) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_75|) 0) (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_75| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_75|)) |c_#memory_$Pointer$#1.base|)))) is different from true [2024-10-14 18:14:08,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:08,519 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-14 18:14:08,540 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2024-10-14 18:14:08,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2024-10-14 18:14:08,669 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 66 treesize of output 38 [2024-10-14 18:14:08,766 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 33 treesize of output 17 [2024-10-14 18:14:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-14 18:14:08,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:08,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095186717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:08,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:14:08,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2024-10-14 18:14:08,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601175537] [2024-10-14 18:14:08,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:08,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-14 18:14:08,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-14 18:14:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1738, Unknown=1, NotChecked=84, Total=1980 [2024-10-14 18:14:08,934 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 42 states, 34 states have (on average 2.235294117647059) internal successors, (76), 36 states have internal predecessors, (76), 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-14 18:14:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:10,149 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-10-14 18:14:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 18:14:10,149 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 2.235294117647059) internal successors, (76), 36 states have internal predecessors, (76), 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 45 [2024-10-14 18:14:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:10,150 INFO L225 Difference]: With dead ends: 93 [2024-10-14 18:14:10,150 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 18:14:10,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=334, Invalid=3575, Unknown=1, NotChecked=122, Total=4032 [2024-10-14 18:14:10,152 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 85 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:10,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 821 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1336 Invalid, 0 Unknown, 104 Unchecked, 0.7s Time] [2024-10-14 18:14:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 18:14:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2024-10-14 18:14:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 75 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-14 18:14:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-10-14 18:14:10,155 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 45 [2024-10-14 18:14:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:10,155 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-10-14 18:14:10,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 2.235294117647059) internal successors, (76), 36 states have internal predecessors, (76), 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-14 18:14:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-10-14 18:14:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 18:14:10,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:10,159 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:10,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:10,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 18:14:10,360 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:10,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1967022406, now seen corresponding path program 1 times [2024-10-14 18:14:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:10,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17350809] [2024-10-14 18:14:10,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:10,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:11,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:11,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:11,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17350809] [2024-10-14 18:14:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17350809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992423943] [2024-10-14 18:14:11,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:11,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:11,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:11,860 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:11,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 18:14:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:12,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-10-14 18:14:12,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:12,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:14:12,401 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-14 18:14:12,679 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-14 18:14:12,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 18:14:12,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-14 18:14:12,811 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:14:12,811 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-14 18:14:12,815 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-14 18:14:12,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-14 18:14:12,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-10-14 18:14:12,993 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 11 treesize of output 7 [2024-10-14 18:14:13,067 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:14:13,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-10-14 18:14:13,072 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 31 treesize of output 16 [2024-10-14 18:14:13,273 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 43 treesize of output 19 [2024-10-14 18:14:13,276 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-14 18:14:13,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 18:14:13,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:13,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2024-10-14 18:14:13,490 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|v_node_create_~temp~0#1.base_84| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_84| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_84|))) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_84| (select |c_#length| |v_node_create_~temp~0#1.base_84|)) |c_#length|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_84|) 0) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_84| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_84|)))))) is different from true [2024-10-14 18:14:13,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:13,505 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 51 treesize of output 34 [2024-10-14 18:14:13,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:13,511 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-14 18:14:13,526 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 18:14:13,526 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-14 18:14:13,530 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 31 treesize of output 20 [2024-10-14 18:14:13,626 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 59 treesize of output 35 [2024-10-14 18:14:13,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:14:13,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:14:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:14:13,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992423943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:13,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:14:13,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 49 [2024-10-14 18:14:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129008566] [2024-10-14 18:14:13,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:13,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 18:14:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 18:14:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2582, Unknown=1, NotChecked=102, Total=2862 [2024-10-14 18:14:13,988 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 50 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 43 states have internal predecessors, (77), 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-14 18:14:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:16,608 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-10-14 18:14:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 18:14:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 43 states have internal predecessors, (77), 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 45 [2024-10-14 18:14:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:16,610 INFO L225 Difference]: With dead ends: 88 [2024-10-14 18:14:16,610 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 18:14:16,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=360, Invalid=4899, Unknown=1, NotChecked=142, Total=5402 [2024-10-14 18:14:16,612 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 64 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:16,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1007 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1699 Invalid, 0 Unknown, 96 Unchecked, 1.1s Time] [2024-10-14 18:14:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 18:14:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-10-14 18:14:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 77 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-14 18:14:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2024-10-14 18:14:16,615 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 45 [2024-10-14 18:14:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2024-10-14 18:14:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 43 states have internal predecessors, (77), 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-14 18:14:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2024-10-14 18:14:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 18:14:16,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:16,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:16,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 18:14:16,817 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1967016874, now seen corresponding path program 1 times [2024-10-14 18:14:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617022089] [2024-10-14 18:14:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:16,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:14:16,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:16,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617022089] [2024-10-14 18:14:16,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617022089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:16,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:14:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927382426] [2024-10-14 18:14:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:16,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:14:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:16,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:14:16,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:14:16,946 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:14:17,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:17,040 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2024-10-14 18:14:17,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:17,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-10-14 18:14:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:17,041 INFO L225 Difference]: With dead ends: 82 [2024-10-14 18:14:17,041 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 18:14:17,041 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-14 18:14:17,041 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:17,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 200 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 18:14:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 18:14:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 76 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-14 18:14:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-10-14 18:14:17,044 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 45 [2024-10-14 18:14:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:17,044 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-10-14 18:14:17,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:14:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-10-14 18:14:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 18:14:17,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:17,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:17,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 18:14:17,046 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:17,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1967016875, now seen corresponding path program 1 times [2024-10-14 18:14:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563942703] [2024-10-14 18:14:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 18:14:17,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:17,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563942703] [2024-10-14 18:14:17,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563942703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:17,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:17,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:14:17,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354984134] [2024-10-14 18:14:17,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:17,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:14:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:17,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:14:17,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:14:17,240 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-14 18:14:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:17,333 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-10-14 18:14:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:17,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 45 [2024-10-14 18:14:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:17,334 INFO L225 Difference]: With dead ends: 81 [2024-10-14 18:14:17,334 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 18:14:17,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-14 18:14:17,334 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:17,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 208 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 18:14:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 18:14:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.360655737704918) internal successors, (83), 75 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-14 18:14:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-10-14 18:14:17,337 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 45 [2024-10-14 18:14:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:17,337 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-10-14 18:14:17,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-14 18:14:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-10-14 18:14:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 18:14:17,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:17,338 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:17,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 18:14:17,338 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1693532321, now seen corresponding path program 1 times [2024-10-14 18:14:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630850033] [2024-10-14 18:14:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:14:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630850033] [2024-10-14 18:14:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630850033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972817051] [2024-10-14 18:14:17,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:17,609 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:17,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 18:14:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:17,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 18:14:17,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:17,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 18:14:17,941 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-14 18:14:17,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:14:17,967 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-14 18:14:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 18:14:17,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972817051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-14 18:14:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551015843] [2024-10-14 18:14:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:17,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:14:17,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:14:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-14 18:14:17,987 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:18,121 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-10-14 18:14:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:14:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-10-14 18:14:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:18,122 INFO L225 Difference]: With dead ends: 105 [2024-10-14 18:14:18,122 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 18:14:18,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:14:18,123 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:18,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 265 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 18:14:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2024-10-14 18:14:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 81 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-14 18:14:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-10-14 18:14:18,126 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 45 [2024-10-14 18:14:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:18,126 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-10-14 18:14:18,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.833333333333333) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-10-14 18:14:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 18:14:18,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:18,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:18,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:18,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:18,327 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:18,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1693532320, now seen corresponding path program 1 times [2024-10-14 18:14:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:18,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052475810] [2024-10-14 18:14:18,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:18,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:18,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:14:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052475810] [2024-10-14 18:14:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052475810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:14:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948921676] [2024-10-14 18:14:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:18,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:14:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:18,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:14:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:14:18,526 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:18,691 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-10-14 18:14:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:14:18,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-10-14 18:14:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:18,692 INFO L225 Difference]: With dead ends: 107 [2024-10-14 18:14:18,692 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 18:14:18,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:14:18,693 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 31 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:18,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 288 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 18:14:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 86. [2024-10-14 18:14:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 80 states have internal predecessors, (90), 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-14 18:14:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-10-14 18:14:18,697 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 45 [2024-10-14 18:14:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:18,697 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-10-14 18:14:18,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-10-14 18:14:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 18:14:18,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:18,698 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 18:14:18,698 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -969281639, now seen corresponding path program 2 times [2024-10-14 18:14:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243540838] [2024-10-14 18:14:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:20,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:20,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:21,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243540838] [2024-10-14 18:14:21,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243540838] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889354200] [2024-10-14 18:14:21,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:14:21,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:21,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:21,147 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:21,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:14:21,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:14:21,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:14:21,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-14 18:14:21,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:21,618 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-14 18:14:21,623 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-14 18:14:21,834 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 18:14:21,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 18:14:21,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:14:21,845 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-14 18:14:21,850 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-14 18:14:21,944 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-14 18:14:21,948 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-14 18:14:22,003 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 21 treesize of output 20 [2024-10-14 18:14:22,009 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 21 treesize of output 20 [2024-10-14 18:14:22,097 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-10-14 18:14:22,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 57 [2024-10-14 18:14:22,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-10-14 18:14:22,396 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-14 18:14:22,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 45 [2024-10-14 18:14:22,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2024-10-14 18:14:22,405 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-14 18:14:22,441 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_94| Int)) (and (= (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_94| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_94|)) |c_#memory_$Pointer$#1.base|) (= (store |c_old(#memory_$Pointer$#1.offset)| |v_node_create_~temp~0#1.base_94| (select |c_#memory_$Pointer$#1.offset| |v_node_create_~temp~0#1.base_94|)) |c_#memory_$Pointer$#1.offset|) (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_94|)))) is different from true [2024-10-14 18:14:22,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:22,460 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 18:14:22,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 103 [2024-10-14 18:14:22,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:22,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:22,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2024-10-14 18:14:22,485 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-10-14 18:14:22,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-10-14 18:14:22,598 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 139 treesize of output 103 [2024-10-14 18:14:22,600 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 107 treesize of output 75 [2024-10-14 18:14:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2024-10-14 18:14:22,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889354200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:23,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:14:23,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2024-10-14 18:14:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084050905] [2024-10-14 18:14:23,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-14 18:14:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-14 18:14:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2701, Unknown=1, NotChecked=104, Total=2970 [2024-10-14 18:14:23,159 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 51 states, 43 states have (on average 1.744186046511628) internal successors, (75), 44 states have internal predecessors, (75), 6 states have call successors, (6), 3 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-14 18:14:24,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:24,902 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2024-10-14 18:14:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 18:14:24,903 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 1.744186046511628) internal successors, (75), 44 states have internal predecessors, (75), 6 states have call successors, (6), 3 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 48 [2024-10-14 18:14:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:24,904 INFO L225 Difference]: With dead ends: 109 [2024-10-14 18:14:24,904 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 18:14:24,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=280, Invalid=4835, Unknown=1, NotChecked=140, Total=5256 [2024-10-14 18:14:24,906 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:24,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1440 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1873 Invalid, 0 Unknown, 102 Unchecked, 1.0s Time] [2024-10-14 18:14:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 18:14:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2024-10-14 18:14:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 97 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:14:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2024-10-14 18:14:24,909 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 48 [2024-10-14 18:14:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:24,910 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2024-10-14 18:14:24,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 1.744186046511628) internal successors, (75), 44 states have internal predecessors, (75), 6 states have call successors, (6), 3 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-14 18:14:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2024-10-14 18:14:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 18:14:24,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:24,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:24,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 18:14:25,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 18:14:25,112 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:25,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:25,112 INFO L85 PathProgramCache]: Analyzing trace with hash -960608055, now seen corresponding path program 1 times [2024-10-14 18:14:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:25,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198573085] [2024-10-14 18:14:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 18:14:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198573085] [2024-10-14 18:14:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198573085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:25,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:14:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854950197] [2024-10-14 18:14:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:25,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:14:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:25,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:14:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:14:25,216 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:14:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:25,271 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-10-14 18:14:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:25,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-10-14 18:14:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:25,272 INFO L225 Difference]: With dead ends: 121 [2024-10-14 18:14:25,273 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 18:14:25,273 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-14 18:14:25,273 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:25,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 141 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 18:14:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2024-10-14 18:14:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.313953488372093) internal successors, (113), 99 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:14:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2024-10-14 18:14:25,277 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 48 [2024-10-14 18:14:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:25,277 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2024-10-14 18:14:25,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:14:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2024-10-14 18:14:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 18:14:25,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:25,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:25,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 18:14:25,278 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -960710211, now seen corresponding path program 1 times [2024-10-14 18:14:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741474445] [2024-10-14 18:14:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-14 18:14:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741474445] [2024-10-14 18:14:25,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741474445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:25,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070372005] [2024-10-14 18:14:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:25,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:25,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:25,756 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:25,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:14:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:26,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 18:14:26,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:26,047 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-14 18:14:26,080 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:14:26,080 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-14 18:14:26,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 18:14:26,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 18:14:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:14:26,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070372005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:26,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 20 [2024-10-14 18:14:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895158840] [2024-10-14 18:14:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 18:14:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:26,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 18:14:26,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2024-10-14 18:14:26,163 INFO L87 Difference]: Start difference. First operand 107 states and 123 transitions. Second operand has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:26,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:26,376 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2024-10-14 18:14:26,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 18:14:26,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2024-10-14 18:14:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:26,377 INFO L225 Difference]: With dead ends: 124 [2024-10-14 18:14:26,377 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 18:14:26,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2024-10-14 18:14:26,379 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 33 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:26,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 490 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:14:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 18:14:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2024-10-14 18:14:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.302325581395349) internal successors, (112), 99 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:14:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-10-14 18:14:26,387 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 48 [2024-10-14 18:14:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:26,387 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-10-14 18:14:26,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2024-10-14 18:14:26,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 18:14:26,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:26,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:26,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 18:14:26,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:26,589 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:26,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash -695775714, now seen corresponding path program 1 times [2024-10-14 18:14:26,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:26,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78171803] [2024-10-14 18:14:26,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:14:26,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:26,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78171803] [2024-10-14 18:14:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78171803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443500869] [2024-10-14 18:14:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:26,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:26,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:26,904 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:26,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:14:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:27,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 18:14:27,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:27,184 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-14 18:14:27,339 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-14 18:14:27,342 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-14 18:14:27,375 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_18|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2024-10-14 18:14:27,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:27,404 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-14 18:14:27,411 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:14:27,412 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-14 18:14:27,485 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-14 18:14:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2024-10-14 18:14:27,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443500869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:27,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:14:27,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-14 18:14:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327706644] [2024-10-14 18:14:27,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:27,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:14:27,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:27,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:14:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=586, Unknown=1, NotChecked=48, Total=702 [2024-10-14 18:14:27,656 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 24 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:14:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:28,295 INFO L93 Difference]: Finished difference Result 129 states and 147 transitions. [2024-10-14 18:14:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 18:14:28,295 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-10-14 18:14:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:28,296 INFO L225 Difference]: With dead ends: 129 [2024-10-14 18:14:28,296 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 18:14:28,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1337, Unknown=1, NotChecked=74, Total=1560 [2024-10-14 18:14:28,297 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 87 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:28,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 704 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 832 Invalid, 0 Unknown, 102 Unchecked, 0.4s Time] [2024-10-14 18:14:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 18:14:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2024-10-14 18:14:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 100 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:14:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2024-10-14 18:14:28,300 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 49 [2024-10-14 18:14:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:28,300 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2024-10-14 18:14:28,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:14:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2024-10-14 18:14:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 18:14:28,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:28,301 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:28,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:28,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:28,503 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:28,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -695775715, now seen corresponding path program 1 times [2024-10-14 18:14:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:28,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127708886] [2024-10-14 18:14:28,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:28,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:28,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-14 18:14:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127708886] [2024-10-14 18:14:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127708886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:28,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:14:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36591214] [2024-10-14 18:14:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:28,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:14:28,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:28,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:14:28,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:14:28,726 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:28,891 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2024-10-14 18:14:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:14:28,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2024-10-14 18:14:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:28,893 INFO L225 Difference]: With dead ends: 133 [2024-10-14 18:14:28,893 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 18:14:28,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:14:28,893 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 38 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:28,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 264 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:14:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 18:14:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2024-10-14 18:14:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.302325581395349) internal successors, (112), 99 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:14:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2024-10-14 18:14:28,896 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 49 [2024-10-14 18:14:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:28,897 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2024-10-14 18:14:28,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2024-10-14 18:14:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 18:14:28,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:28,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:28,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 18:14:28,898 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:28,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash 323027275, now seen corresponding path program 1 times [2024-10-14 18:14:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93494178] [2024-10-14 18:14:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-14 18:14:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93494178] [2024-10-14 18:14:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93494178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 18:14:29,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869173735] [2024-10-14 18:14:29,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:14:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:14:29,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:14:29,192 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:29,362 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2024-10-14 18:14:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:14:29,363 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2024-10-14 18:14:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:29,364 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:14:29,364 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:14:29,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-14 18:14:29,364 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 25 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:29,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 435 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:14:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2024-10-14 18:14:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 101 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:14:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-10-14 18:14:29,367 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 49 [2024-10-14 18:14:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:29,368 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-10-14 18:14:29,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:14:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-10-14 18:14:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 18:14:29,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:29,368 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:29,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 18:14:29,369 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:14:29,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash 323121649, now seen corresponding path program 1 times [2024-10-14 18:14:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:29,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698982965] [2024-10-14 18:14:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:14:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:14:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:14:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 18:14:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698982965] [2024-10-14 18:14:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698982965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141690655] [2024-10-14 18:14:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:29,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:29,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:29,632 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:29,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 18:14:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:29,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 18:14:29,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:29,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 18:14:29,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 18:14:29,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-14 18:14:29,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-14 18:14:30,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:30,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 18:14:30,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 18:14:30,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:14:30,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 18:14:30,173 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 76 treesize of output 56 [2024-10-14 18:14:30,175 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 60 treesize of output 40 [2024-10-14 18:14:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:14:30,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:30,302 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 64 treesize of output 60 [2024-10-14 18:14:30,304 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 98 treesize of output 90 [2024-10-14 18:14:30,326 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 64 treesize of output 60 [2024-10-14 18:14:30,331 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 98 treesize of output 90 [2024-10-14 18:15:02,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:02,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 888 treesize of output 916 [2024-10-14 18:15:02,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:02,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1113 treesize of output 1135 [2024-10-14 18:15:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 18:15:02,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141690655] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:02,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:02,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2024-10-14 18:15:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726793037] [2024-10-14 18:15:02,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:02,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:15:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:15:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=493, Unknown=6, NotChecked=0, Total=552 [2024-10-14 18:15:02,846 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 24 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:03,371 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-10-14 18:15:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 18:15:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-10-14 18:15:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:03,372 INFO L225 Difference]: With dead ends: 103 [2024-10-14 18:15:03,372 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 18:15:03,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=103, Invalid=947, Unknown=6, NotChecked=0, Total=1056 [2024-10-14 18:15:03,378 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:03,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 730 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 18:15:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 18:15:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 18:15:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 95 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 18:15:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-10-14 18:15:03,381 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 49 [2024-10-14 18:15:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:03,381 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-10-14 18:15:03,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-14 18:15:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-10-14 18:15:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 18:15:03,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:03,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:03,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:03,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-14 18:15:03,582 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2024-10-14 18:15:03,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash -343384288, now seen corresponding path program 1 times [2024-10-14 18:15:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217585046] [2024-10-14 18:15:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:03,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 18:15:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 18:15:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 18:15:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:15:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217585046] [2024-10-14 18:15:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217585046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026498850] [2024-10-14 18:15:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:03,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:03,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:03,781 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:03,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-14 18:15:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:04,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 18:15:04,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:04,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-14 18:15:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:15:04,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 18:15:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026498850] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:04,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:04,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-10-14 18:15:04,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584927818] [2024-10-14 18:15:04,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:04,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:15:04,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:15:04,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:15:04,218 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:15:08,227 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-14 18:15:12,234 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-14 18:15:16,252 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-14 18:15:20,259 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-14 18:15:24,268 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]