./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.c -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 8785e3342657a20959329ec5f95de086052a8e1dc96c38aeea8026897f4abcc4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:19:52,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:19:52,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:19:52,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:19:52,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:19:52,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:19:52,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:19:52,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:19:52,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:19:52,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:19:52,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:19:52,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:19:52,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:19:52,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:19:52,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:19:52,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:52,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:52,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:52,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:19:52,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8785e3342657a20959329ec5f95de086052a8e1dc96c38aeea8026897f4abcc4 [2025-04-29 11:19:52,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:19:52,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:19:52,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:19:52,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:19:52,884 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:19:52,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_insert_unequal.c [2025-04-29 11:19:54,200 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea343c03d/5ca5ab425bb141e4a619ef2552aa629d/FLAG0b1725e77 [2025-04-29 11:19:54,397 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:19:54,398 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_insert_unequal.c [2025-04-29 11:19:54,399 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:54,399 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:54,419 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea343c03d/5ca5ab425bb141e4a619ef2552aa629d/FLAG0b1725e77 [2025-04-29 11:19:55,200 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea343c03d/5ca5ab425bb141e4a619ef2552aa629d [2025-04-29 11:19:55,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:19:55,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:19:55,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:55,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:19:55,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:19:55,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45cc8911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55, skipping insertion in model container [2025-04-29 11:19:55,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:19:55,357 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:55,369 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:19:55,408 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:55,418 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:19:55,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55 WrapperNode [2025-04-29 11:19:55,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:55,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:55,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:19:55,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:19:55,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,446 INFO L138 Inliner]: procedures = 18, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 153 [2025-04-29 11:19:55,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:55,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:19:55,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:19:55,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:19:55,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,476 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [21, 8]. 72 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 14 writes are split as follows [13, 1]. [2025-04-29 11:19:55,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:19:55,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:19:55,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:19:55,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:19:55,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (1/1) ... [2025-04-29 11:19:55,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:55,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:55,530 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) [2025-04-29 11:19:55,532 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 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-29 11:19:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:19:55,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:19:55,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:19:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:19:55,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:19:55,632 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:19:55,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:19:55,661 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-29 11:19:55,975 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-04-29 11:19:55,975 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:19:55,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:19:55,985 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:19:55,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:55 BoogieIcfgContainer [2025-04-29 11:19:55,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:19:55,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:19:55,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:19:55,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:19:55,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:19:55" (1/3) ... [2025-04-29 11:19:55,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b67e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:55, skipping insertion in model container [2025-04-29 11:19:55,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:55" (2/3) ... [2025-04-29 11:19:55,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b67e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:55, skipping insertion in model container [2025-04-29 11:19:55,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:55" (3/3) ... [2025-04-29 11:19:55,993 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.c [2025-04-29 11:19:56,004 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:19:56,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_insert_unequal.c that has 2 procedures, 134 locations, 151 edges, 1 initial locations, 5 loop locations, and 60 error locations. [2025-04-29 11:19:56,040 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:19:56,049 INFO L340 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;@578f346d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:19:56,049 INFO L341 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-04-29 11:19:56,052 INFO L278 IsEmpty]: Start isEmpty. Operand has 133 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 131 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:19:56,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:56,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:19:56,057 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:56,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:56,061 INFO L85 PathProgramCache]: Analyzing trace with hash 33466411, now seen corresponding path program 1 times [2025-04-29 11:19:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:56,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456272978] [2025-04-29 11:19:56,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:56,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:19:56,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:19:56,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:56,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:56,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:56,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456272978] [2025-04-29 11:19:56,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456272978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:56,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:56,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430149051] [2025-04-29 11:19:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:56,224 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:56,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:56,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:56,243 INFO L87 Difference]: Start difference. First operand has 133 states, 70 states have (on average 2.0714285714285716) internal successors, (145), 131 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:56,376 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2025-04-29 11:19:56,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:56,379 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:19:56,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:56,385 INFO L225 Difference]: With dead ends: 129 [2025-04-29 11:19:56,386 INFO L226 Difference]: Without dead ends: 122 [2025-04-29 11:19:56,388 INFO L436 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 [2025-04-29 11:19:56,390 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:56,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 201 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-29 11:19:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-04-29 11:19:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 2.0) internal successors, (130), 121 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2025-04-29 11:19:56,419 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 5 [2025-04-29 11:19:56,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:56,420 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2025-04-29 11:19:56,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,420 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2025-04-29 11:19:56,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:19:56,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:56,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:19:56,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:19:56,422 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:56,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash 33466412, now seen corresponding path program 1 times [2025-04-29 11:19:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:56,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693152481] [2025-04-29 11:19:56,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:56,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:19:56,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:19:56,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:56,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:56,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:56,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693152481] [2025-04-29 11:19:56,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693152481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:56,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:56,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405871281] [2025-04-29 11:19:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:56,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:56,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:56,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:56,493 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:56,569 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2025-04-29 11:19:56,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:56,569 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:19:56,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:56,570 INFO L225 Difference]: With dead ends: 119 [2025-04-29 11:19:56,570 INFO L226 Difference]: Without dead ends: 119 [2025-04-29 11:19:56,570 INFO L436 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 [2025-04-29 11:19:56,571 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:56,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 186 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-29 11:19:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-04-29 11:19:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 118 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2025-04-29 11:19:56,593 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 5 [2025-04-29 11:19:56,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:56,593 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2025-04-29 11:19:56,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,593 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2025-04-29 11:19:56,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:56,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:56,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:56,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:19:56,594 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:56,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:56,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1038316840, now seen corresponding path program 1 times [2025-04-29 11:19:56,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:56,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808412506] [2025-04-29 11:19:56,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:56,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:56,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:56,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:56,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:56,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808412506] [2025-04-29 11:19:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808412506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679905201] [2025-04-29 11:19:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:56,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:56,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:56,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:56,650 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:56,661 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2025-04-29 11:19:56,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:56,661 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:19:56,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:56,663 INFO L225 Difference]: With dead ends: 129 [2025-04-29 11:19:56,663 INFO L226 Difference]: Without dead ends: 129 [2025-04-29 11:19:56,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:56,664 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:56,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 247 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-29 11:19:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2025-04-29 11:19:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 66 states have (on average 1.9393939393939394) internal successors, (128), 119 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2025-04-29 11:19:56,674 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 6 [2025-04-29 11:19:56,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:56,674 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2025-04-29 11:19:56,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,674 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2025-04-29 11:19:56,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:19:56,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:56,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:56,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:19:56,675 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:56,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 348447983, now seen corresponding path program 1 times [2025-04-29 11:19:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:56,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580655295] [2025-04-29 11:19:56,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:56,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:19:56,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:19:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:56,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580655295] [2025-04-29 11:19:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580655295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748190948] [2025-04-29 11:19:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:56,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:56,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:56,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:56,745 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:56,764 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2025-04-29 11:19:56,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:56,767 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:19:56,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:56,767 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:19:56,767 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:19:56,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:56,768 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:56,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:19:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-04-29 11:19:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.8732394366197183) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2025-04-29 11:19:56,775 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 9 [2025-04-29 11:19:56,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:56,775 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2025-04-29 11:19:56,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:56,775 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2025-04-29 11:19:56,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:19:56,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:56,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:56,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:19:56,775 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:56,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:56,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1245978540, now seen corresponding path program 1 times [2025-04-29 11:19:56,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:56,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846736455] [2025-04-29 11:19:56,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:56,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:56,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:19:56,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:19:56,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:56,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:56,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846736455] [2025-04-29 11:19:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846736455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:56,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549737065] [2025-04-29 11:19:56,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:56,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:56,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:56,889 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) [2025-04-29 11:19:56,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:19:56,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:19:56,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:19:56,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:56,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:56,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:19:56,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:57,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:57,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549737065] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:57,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-29 11:19:57,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876812785] [2025-04-29 11:19:57,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:57,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:57,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:57,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:57,037 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:57,057 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2025-04-29 11:19:57,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:57,057 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 11:19:57,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:57,058 INFO L225 Difference]: With dead ends: 127 [2025-04-29 11:19:57,058 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 11:19:57,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:57,060 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 10 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:57,060 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 256 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 11:19:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-04-29 11:19:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2025-04-29 11:19:57,070 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 13 [2025-04-29 11:19:57,070 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:57,070 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2025-04-29 11:19:57,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:57,070 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2025-04-29 11:19:57,070 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:19:57,070 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:57,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:57,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:57,271 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:57,271 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:57,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1633379773, now seen corresponding path program 1 times [2025-04-29 11:19:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:57,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720643787] [2025-04-29 11:19:57,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:57,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:19:57,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:19:57,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:57,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:57,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:57,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720643787] [2025-04-29 11:19:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720643787] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:57,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862147729] [2025-04-29 11:19:57,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:57,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:57,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:57,419 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) [2025-04-29 11:19:57,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:19:57,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:19:57,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:19:57,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:57,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:19:57,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:57,528 INFO L354 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 [2025-04-29 11:19:57,559 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:19:57,559 INFO L354 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 [2025-04-29 11:19:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:57,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862147729] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:57,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:57,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-04-29 11:19:57,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582778823] [2025-04-29 11:19:57,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:57,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:57,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:57,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:57,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:57,618 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:57,750 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2025-04-29 11:19:57,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:57,751 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:19:57,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:57,751 INFO L225 Difference]: With dead ends: 126 [2025-04-29 11:19:57,751 INFO L226 Difference]: Without dead ends: 126 [2025-04-29 11:19:57,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:57,752 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 3 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:57,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 297 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-29 11:19:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-29 11:19:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 73 states have (on average 1.8356164383561644) internal successors, (134), 125 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2025-04-29 11:19:57,755 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 16 [2025-04-29 11:19:57,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:57,756 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2025-04-29 11:19:57,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:57,756 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2025-04-29 11:19:57,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:19:57,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:57,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:57,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:57,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 11:19:57,957 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:57,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1633379772, now seen corresponding path program 1 times [2025-04-29 11:19:57,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:57,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631385926] [2025-04-29 11:19:57,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:57,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:57,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:19:57,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:19:57,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:57,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:58,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631385926] [2025-04-29 11:19:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631385926] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:58,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006303001] [2025-04-29 11:19:58,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:58,121 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) [2025-04-29 11:19:58,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:19:58,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:19:58,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:19:58,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:58,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:58,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:19:58,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:58,206 INFO L354 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 [2025-04-29 11:19:58,211 INFO L354 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 [2025-04-29 11:19:58,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:58,293 INFO L354 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 [2025-04-29 11:19:58,299 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:58,299 INFO L354 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 [2025-04-29 11:19:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:58,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006303001] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:58,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:58,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-04-29 11:19:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909474654] [2025-04-29 11:19:58,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:58,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:19:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:58,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:19:58,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:19:58,543 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:58,902 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2025-04-29 11:19:58,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:58,902 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:19:58,902 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:58,903 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:19:58,903 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:19:58,903 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:19:58,903 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:58,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 521 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:19:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:19:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-04-29 11:19:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 73 states have (on average 1.821917808219178) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2025-04-29 11:19:58,906 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 16 [2025-04-29 11:19:58,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:58,907 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2025-04-29 11:19:58,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:58,907 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2025-04-29 11:19:58,907 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:19:58,907 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:58,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:58,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:19:59,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:59,108 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:59,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 861457320, now seen corresponding path program 2 times [2025-04-29 11:19:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:59,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023784791] [2025-04-29 11:19:59,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:19:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:59,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-29 11:19:59,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 20 statements. [2025-04-29 11:19:59,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:19:59,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:59,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023784791] [2025-04-29 11:19:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023784791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:59,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:59,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649857569] [2025-04-29 11:19:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:59,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:59,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:59,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:59,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:59,134 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:59,188 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2025-04-29 11:19:59,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:59,189 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:19:59,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:59,189 INFO L225 Difference]: With dead ends: 122 [2025-04-29 11:19:59,189 INFO L226 Difference]: Without dead ends: 122 [2025-04-29 11:19:59,189 INFO L436 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 [2025-04-29 11:19:59,190 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:59,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 173 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:59,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-29 11:19:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-04-29 11:19:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.7808219178082192) internal successors, (130), 121 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2025-04-29 11:19:59,198 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 20 [2025-04-29 11:19:59,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:59,198 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2025-04-29 11:19:59,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,198 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2025-04-29 11:19:59,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:19:59,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:59,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:59,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:19:59,199 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:59,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash 861457321, now seen corresponding path program 1 times [2025-04-29 11:19:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:59,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761683168] [2025-04-29 11:19:59,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:59,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:19:59,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:19:59,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:59,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:59,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:59,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761683168] [2025-04-29 11:19:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761683168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:59,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581432606] [2025-04-29 11:19:59,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:59,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:59,278 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) [2025-04-29 11:19:59,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:19:59,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:19:59,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:19:59,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:59,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:59,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:19:59,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:59,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:59,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581432606] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:59,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:59,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-29 11:19:59,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948560480] [2025-04-29 11:19:59,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:59,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:59,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:59,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:59,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:19:59,383 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:59,411 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2025-04-29 11:19:59,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:59,414 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 11:19:59,414 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:59,414 INFO L225 Difference]: With dead ends: 122 [2025-04-29 11:19:59,414 INFO L226 Difference]: Without dead ends: 122 [2025-04-29 11:19:59,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:59,415 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:59,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 336 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-29 11:19:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-04-29 11:19:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 121 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2025-04-29 11:19:59,417 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 20 [2025-04-29 11:19:59,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:59,417 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2025-04-29 11:19:59,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,421 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2025-04-29 11:19:59,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:19:59,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:59,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:59,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:59,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:59,623 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:59,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 619134697, now seen corresponding path program 1 times [2025-04-29 11:19:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:59,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602771371] [2025-04-29 11:19:59,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:59,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:59,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:19:59,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:19:59,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:59,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:19:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:59,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602771371] [2025-04-29 11:19:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602771371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:59,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492258652] [2025-04-29 11:19:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:59,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:59,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:59,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:59,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:59,701 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:59,754 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2025-04-29 11:19:59,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:59,755 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 11:19:59,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:59,755 INFO L225 Difference]: With dead ends: 119 [2025-04-29 11:19:59,755 INFO L226 Difference]: Without dead ends: 119 [2025-04-29 11:19:59,755 INFO L436 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 [2025-04-29 11:19:59,756 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:59,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 178 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-29 11:19:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-04-29 11:19:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.726027397260274) internal successors, (126), 118 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2025-04-29 11:19:59,760 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 21 [2025-04-29 11:19:59,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:59,760 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2025-04-29 11:19:59,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:59,761 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2025-04-29 11:19:59,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:59,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:59,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:59,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:19:59,761 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:19:59,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 756392274, now seen corresponding path program 1 times [2025-04-29 11:19:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:59,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647637319] [2025-04-29 11:19:59,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:59,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:59,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:59,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:59,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:59,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:59,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647637319] [2025-04-29 11:19:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647637319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:59,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505203742] [2025-04-29 11:19:59,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:59,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:59,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:59,968 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) [2025-04-29 11:19:59,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:20:00,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:20:00,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:20:00,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:00,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:00,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:20:00,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:00,065 INFO L354 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 [2025-04-29 11:20:00,079 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:20:00,079 INFO L354 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 [2025-04-29 11:20:00,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:00,141 INFO L354 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 [2025-04-29 11:20:00,192 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:20:00,192 INFO L354 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 [2025-04-29 11:20:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:00,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:20,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505203742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:20:20,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:20:20,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-29 11:20:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670623057] [2025-04-29 11:20:20,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:20,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:20:20,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:20,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:20:20,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=145, Unknown=6, NotChecked=0, Total=210 [2025-04-29 11:20:20,337 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:20,495 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2025-04-29 11:20:20,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:20:20,495 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:20:20,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:20,498 INFO L225 Difference]: With dead ends: 125 [2025-04-29 11:20:20,498 INFO L226 Difference]: Without dead ends: 125 [2025-04-29 11:20:20,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=72, Invalid=162, Unknown=6, NotChecked=0, Total=240 [2025-04-29 11:20:20,498 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 267 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:20,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 210 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-29 11:20:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2025-04-29 11:20:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 73 states have (on average 1.63013698630137) internal successors, (119), 111 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2025-04-29 11:20:20,502 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 26 [2025-04-29 11:20:20,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:20,502 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2025-04-29 11:20:20,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:20,502 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2025-04-29 11:20:20,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:20:20,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:20,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:20,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:20:20,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:20:20,705 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:20,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash 756392275, now seen corresponding path program 1 times [2025-04-29 11:20:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:20,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017539241] [2025-04-29 11:20:20,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:20,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:20,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:20:20,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:20:20,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:20,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:21,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017539241] [2025-04-29 11:20:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017539241] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:21,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007285610] [2025-04-29 11:20:21,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:21,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:21,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:21,219 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) [2025-04-29 11:20:21,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:20:21,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:20:21,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:20:21,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:21,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:21,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:20:21,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:21,346 INFO L354 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 [2025-04-29 11:20:21,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:21,363 INFO L354 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 [2025-04-29 11:20:21,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:21,402 INFO L354 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 [2025-04-29 11:20:21,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:21,454 INFO L354 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 [2025-04-29 11:20:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:21,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:20:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007285610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:20:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2025-04-29 11:20:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307931629] [2025-04-29 11:20:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:21,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:20:21,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:21,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:20:21,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:20:21,482 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:21,564 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2025-04-29 11:20:21,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:20:21,565 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 11:20:21,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:21,565 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:20:21,565 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:20:21,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:20:21,566 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 114 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:21,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 110 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:20:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-04-29 11:20:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2025-04-29 11:20:21,568 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 26 [2025-04-29 11:20:21,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:21,568 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2025-04-29 11:20:21,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:21,568 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2025-04-29 11:20:21,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:20:21,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:21,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:21,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:20:21,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:21,770 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:21,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2011133487, now seen corresponding path program 1 times [2025-04-29 11:20:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:21,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531788006] [2025-04-29 11:20:21,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:21,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:21,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:20:21,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:20:21,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:21,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:21,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531788006] [2025-04-29 11:20:21,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531788006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:21,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:20:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433351478] [2025-04-29 11:20:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:21,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:20:21,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:21,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:20:21,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:20:21,939 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:22,175 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2025-04-29 11:20:22,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:20:22,175 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:20:22,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:22,177 INFO L225 Difference]: With dead ends: 134 [2025-04-29 11:20:22,177 INFO L226 Difference]: Without dead ends: 134 [2025-04-29 11:20:22,177 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:20:22,177 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 172 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:22,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 320 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:20:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-29 11:20:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2025-04-29 11:20:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 81 states have (on average 1.617283950617284) internal successors, (131), 112 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2025-04-29 11:20:22,180 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 29 [2025-04-29 11:20:22,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:22,180 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2025-04-29 11:20:22,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,181 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2025-04-29 11:20:22,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:20:22,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:22,181 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:22,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:20:22,181 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:22,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2011133486, now seen corresponding path program 1 times [2025-04-29 11:20:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:22,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61048815] [2025-04-29 11:20:22,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:22,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:20:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:20:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:22,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61048815] [2025-04-29 11:20:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61048815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:22,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:20:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214701758] [2025-04-29 11:20:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:22,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:20:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:22,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:20:22,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:20:22,430 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:22,653 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2025-04-29 11:20:22,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:20:22,653 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 11:20:22,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:22,654 INFO L225 Difference]: With dead ends: 134 [2025-04-29 11:20:22,654 INFO L226 Difference]: Without dead ends: 134 [2025-04-29 11:20:22,654 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:20:22,654 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:22,654 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 360 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:20:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-29 11:20:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2025-04-29 11:20:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 81 states have (on average 1.5925925925925926) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2025-04-29 11:20:22,657 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 29 [2025-04-29 11:20:22,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:22,657 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2025-04-29 11:20:22,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,657 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2025-04-29 11:20:22,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:20:22,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:22,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:22,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:20:22,658 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:22,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2079377406, now seen corresponding path program 1 times [2025-04-29 11:20:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:22,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985734612] [2025-04-29 11:20:22,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:22,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:20:22,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:20:22,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:22,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:22,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985734612] [2025-04-29 11:20:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985734612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:20:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471771792] [2025-04-29 11:20:22,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:22,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:20:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:22,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:20:22,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:20:22,695 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:22,706 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2025-04-29 11:20:22,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:20:22,706 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:20:22,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:22,707 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:20:22,707 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:20:22,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:20:22,707 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:22,708 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:20:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:20:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-04-29 11:20:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 107 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2025-04-29 11:20:22,709 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 30 [2025-04-29 11:20:22,710 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:22,710 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2025-04-29 11:20:22,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,710 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2025-04-29 11:20:22,710 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:20:22,710 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:22,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:22,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:20:22,710 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:22,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash 36210026, now seen corresponding path program 1 times [2025-04-29 11:20:22,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:22,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686216233] [2025-04-29 11:20:22,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:22,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:22,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:20:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:20:22,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:22,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686216233] [2025-04-29 11:20:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686216233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:20:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766023943] [2025-04-29 11:20:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:22,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:20:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:22,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:20:22,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:20:22,768 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:22,862 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2025-04-29 11:20:22,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:20:22,862 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:20:22,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:22,863 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:20:22,863 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:20:22,863 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:20:22,863 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 26 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:22,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 210 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:20:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-04-29 11:20:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.486842105263158) internal successors, (113), 104 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-04-29 11:20:22,865 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 31 [2025-04-29 11:20:22,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:22,866 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-04-29 11:20:22,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:22,866 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-04-29 11:20:22,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 11:20:22,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:22,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:22,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:20:22,867 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:22,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash 36210027, now seen corresponding path program 1 times [2025-04-29 11:20:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:22,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142910798] [2025-04-29 11:20:22,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:22,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:20:22,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:20:22,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:22,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:22,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:22,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142910798] [2025-04-29 11:20:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142910798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:22,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:20:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102071992] [2025-04-29 11:20:22,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:22,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:20:22,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:22,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:20:22,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:20:22,975 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:23,067 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-04-29 11:20:23,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:20:23,067 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 11:20:23,067 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:23,068 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:20:23,068 INFO L226 Difference]: Without dead ends: 103 [2025-04-29 11:20:23,068 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:20:23,068 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 25 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:23,068 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 225 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-29 11:20:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-04-29 11:20:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 101 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2025-04-29 11:20:23,070 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 31 [2025-04-29 11:20:23,070 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:23,070 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2025-04-29 11:20:23,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:23,070 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2025-04-29 11:20:23,073 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:20:23,073 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:23,073 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-29 11:20:23,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:20:23,073 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:23,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1116109562, now seen corresponding path program 1 times [2025-04-29 11:20:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:23,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406211256] [2025-04-29 11:20:23,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:23,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:20:23,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:20:23,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:23,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406211256] [2025-04-29 11:20:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406211256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:23,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477509056] [2025-04-29 11:20:23,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:23,187 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) [2025-04-29 11:20:23,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:20:23,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:20:23,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:20:23,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:23,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:23,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:20:23,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:23,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:20:23,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477509056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:23,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:20:23,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-29 11:20:23,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048996885] [2025-04-29 11:20:23,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:23,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:20:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:23,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:20:23,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:20:23,338 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:23,355 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-04-29 11:20:23,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:20:23,356 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-29 11:20:23,356 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:23,356 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:20:23,356 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:20:23,356 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:20:23,357 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:23,357 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 200 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:20:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:20:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:20:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2025-04-29 11:20:23,358 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 32 [2025-04-29 11:20:23,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:23,358 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2025-04-29 11:20:23,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:23,358 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2025-04-29 11:20:23,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:20:23,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:23,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:23,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:20:23,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:23,563 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:23,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash 239664117, now seen corresponding path program 1 times [2025-04-29 11:20:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:23,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121156844] [2025-04-29 11:20:23,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:23,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:23,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:20:23,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:20:23,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:23,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:23,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:23,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121156844] [2025-04-29 11:20:23,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121156844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:23,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522914222] [2025-04-29 11:20:23,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:23,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:23,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:23,711 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) [2025-04-29 11:20:23,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:20:23,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:20:23,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:20:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:23,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-29 11:20:23,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:24,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:20:24,030 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:20:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:24,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:20:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522914222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:20:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-04-29 11:20:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672882415] [2025-04-29 11:20:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:24,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:20:24,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:24,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:20:24,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:20:24,070 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:24,216 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-04-29 11:20:24,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:20:24,216 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:20:24,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:24,217 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:20:24,217 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:20:24,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:20:24,217 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 104 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:24,217 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 421 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:20:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-04-29 11:20:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.4) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2025-04-29 11:20:24,219 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 33 [2025-04-29 11:20:24,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:24,219 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2025-04-29 11:20:24,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,219 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2025-04-29 11:20:24,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:20:24,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:24,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:24,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:20:24,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:24,427 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:24,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash 239664116, now seen corresponding path program 1 times [2025-04-29 11:20:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:24,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79582360] [2025-04-29 11:20:24,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:24,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:20:24,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:20:24,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:24,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:24,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79582360] [2025-04-29 11:20:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79582360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:24,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:24,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:20:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827407514] [2025-04-29 11:20:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:24,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:20:24,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:24,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:20:24,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:20:24,473 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:24,543 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-04-29 11:20:24,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:20:24,543 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-29 11:20:24,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:24,543 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:20:24,543 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:20:24,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:20:24,544 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:24,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:20:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:20:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 96 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2025-04-29 11:20:24,546 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 33 [2025-04-29 11:20:24,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:24,546 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2025-04-29 11:20:24,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,546 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2025-04-29 11:20:24,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:20:24,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:24,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:24,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:20:24,547 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:24,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash -998611352, now seen corresponding path program 1 times [2025-04-29 11:20:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:24,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959248580] [2025-04-29 11:20:24,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:24,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:24,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:20:24,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:20:24,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:24,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:24,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959248580] [2025-04-29 11:20:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959248580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:24,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346500814] [2025-04-29 11:20:24,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:24,638 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) [2025-04-29 11:20:24,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:20:24,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:20:24,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:20:24,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:24,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:24,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:20:24,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:24,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:20:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346500814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:24,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:20:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-04-29 11:20:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565211842] [2025-04-29 11:20:24,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:24,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:20:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:24,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:20:24,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:20:24,799 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:24,811 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-04-29 11:20:24,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:20:24,811 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-29 11:20:24,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:24,812 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:20:24,812 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:20:24,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:20:24,812 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:24,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:20:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:20:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-04-29 11:20:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-04-29 11:20:24,814 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2025-04-29 11:20:24,814 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:24,814 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-04-29 11:20:24,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:24,814 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-04-29 11:20:24,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:20:24,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:24,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:24,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:20:25,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:25,019 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:25,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1998986504, now seen corresponding path program 1 times [2025-04-29 11:20:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:25,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674809626] [2025-04-29 11:20:25,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:25,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:25,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:20:25,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:20:25,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:25,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:25,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674809626] [2025-04-29 11:20:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674809626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:25,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507701234] [2025-04-29 11:20:25,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:25,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:25,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:25,699 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) [2025-04-29 11:20:25,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:20:25,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:20:25,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:20:25,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:25,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:25,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-04-29 11:20:25,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:25,915 INFO L354 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 [2025-04-29 11:20:25,981 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:20:25,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:20:26,039 INFO L354 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 [2025-04-29 11:20:26,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:20:26,106 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:20:26,106 INFO L354 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 [2025-04-29 11:20:26,225 INFO L325 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-04-29 11:20:26,225 INFO L354 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 [2025-04-29 11:20:26,303 INFO L354 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 50 treesize of output 33 [2025-04-29 11:20:26,320 INFO L354 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 50 treesize of output 33 [2025-04-29 11:20:26,342 INFO L354 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 50 treesize of output 33 [2025-04-29 11:20:26,478 INFO L354 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 [2025-04-29 11:20:26,596 INFO L354 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 [2025-04-29 11:20:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:26,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:26,820 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1727 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1727) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) 1)) is different from false [2025-04-29 11:20:26,838 INFO L354 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 34 treesize of output 26 [2025-04-29 11:20:26,841 INFO L354 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 22 [2025-04-29 11:20:35,064 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:35,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2025-04-29 11:20:35,067 INFO L354 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 90 treesize of output 78 [2025-04-29 11:20:35,070 INFO L354 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 38 treesize of output 34 [2025-04-29 11:20:35,072 INFO L354 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 70 treesize of output 62 [2025-04-29 11:20:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:43,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507701234] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:20:43,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:20:43,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 46 [2025-04-29 11:20:43,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437309556] [2025-04-29 11:20:43,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:43,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-29 11:20:43,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:43,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-29 11:20:43,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1876, Unknown=8, NotChecked=88, Total=2162 [2025-04-29 11:20:43,290 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 47 states, 46 states have (on average 2.282608695652174) internal successors, (105), 47 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:44,781 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2025-04-29 11:20:44,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:20:44,782 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.282608695652174) internal successors, (105), 47 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-29 11:20:44,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:44,782 INFO L225 Difference]: With dead ends: 102 [2025-04-29 11:20:44,782 INFO L226 Difference]: Without dead ends: 102 [2025-04-29 11:20:44,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=329, Invalid=2859, Unknown=8, NotChecked=110, Total=3306 [2025-04-29 11:20:44,786 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 110 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:44,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1108 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1837 Invalid, 0 Unknown, 95 Unchecked, 1.1s Time] [2025-04-29 11:20:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-29 11:20:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2025-04-29 11:20:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.364864864864865) internal successors, (101), 94 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2025-04-29 11:20:44,789 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 37 [2025-04-29 11:20:44,789 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:44,789 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2025-04-29 11:20:44,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.282608695652174) internal successors, (105), 47 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:44,790 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2025-04-29 11:20:44,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-29 11:20:44,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:44,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:44,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:20:44,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-29 11:20:44,991 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:44,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1998986503, now seen corresponding path program 1 times [2025-04-29 11:20:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:44,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633457039] [2025-04-29 11:20:44,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:45,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:20:45,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:20:45,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:45,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:45,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633457039] [2025-04-29 11:20:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633457039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:45,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390047196] [2025-04-29 11:20:45,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:45,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:45,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:45,678 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) [2025-04-29 11:20:45,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:20:45,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:20:45,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:20:45,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:45,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:45,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-29 11:20:45,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:45,868 INFO L354 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 [2025-04-29 11:20:45,871 INFO L354 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 [2025-04-29 11:20:45,945 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:20:45,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:20:45,952 INFO L354 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 [2025-04-29 11:20:46,002 INFO L354 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 [2025-04-29 11:20:46,011 INFO L354 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 [2025-04-29 11:20:46,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:20:46,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-29 11:20:46,090 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:20:46,090 INFO L354 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 [2025-04-29 11:20:46,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-04-29 11:20:46,209 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 11:20:46,209 INFO L354 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 [2025-04-29 11:20:46,217 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-04-29 11:20:46,267 INFO L354 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 50 treesize of output 33 [2025-04-29 11:20:46,276 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:20:46,284 INFO L354 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 50 treesize of output 33 [2025-04-29 11:20:46,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:20:46,302 INFO L354 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 50 treesize of output 33 [2025-04-29 11:20:46,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:20:46,350 INFO L354 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 48 treesize of output 28 [2025-04-29 11:20:46,407 INFO L354 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 [2025-04-29 11:20:46,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:20:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:46,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:46,658 INFO L354 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 60 [2025-04-29 11:20:46,661 INFO L354 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 48 [2025-04-29 11:20:47,115 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:47,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2025-04-29 11:20:47,118 INFO L354 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 78 treesize of output 66 [2025-04-29 11:20:47,122 INFO L354 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 32 treesize of output 28 [2025-04-29 11:20:47,124 INFO L354 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 58 treesize of output 50 [2025-04-29 11:20:47,147 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:47,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 70 [2025-04-29 11:20:47,155 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:47,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2025-04-29 11:20:47,159 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:47,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2025-04-29 11:20:47,164 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:20:47,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 90 [2025-04-29 11:20:47,169 INFO L354 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 22 treesize of output 18 [2025-04-29 11:20:47,171 INFO L354 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 18 treesize of output 14 [2025-04-29 11:20:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:47,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390047196] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:20:47,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:20:47,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 42 [2025-04-29 11:20:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107427242] [2025-04-29 11:20:47,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:47,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-29 11:20:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:47,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-29 11:20:47,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1643, Unknown=23, NotChecked=0, Total=1806 [2025-04-29 11:20:47,585 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 43 states, 42 states have (on average 2.380952380952381) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:48,966 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-04-29 11:20:48,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:20:48,966 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.380952380952381) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-29 11:20:48,967 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:48,967 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:20:48,967 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:20:48,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=327, Invalid=2954, Unknown=25, NotChecked=0, Total=3306 [2025-04-29 11:20:48,968 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 102 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:48,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1090 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-29 11:20:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:20:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2025-04-29 11:20:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2025-04-29 11:20:48,970 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 37 [2025-04-29 11:20:48,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:48,970 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2025-04-29 11:20:48,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.380952380952381) internal successors, (100), 43 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:48,970 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2025-04-29 11:20:48,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:20:48,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:48,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:48,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-29 11:20:49,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:20:49,171 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:49,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:49,172 INFO L85 PathProgramCache]: Analyzing trace with hash 482575647, now seen corresponding path program 1 times [2025-04-29 11:20:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:49,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383222797] [2025-04-29 11:20:49,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:49,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:20:49,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:20:49,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:49,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:49,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:49,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383222797] [2025-04-29 11:20:49,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383222797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:49,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751968054] [2025-04-29 11:20:49,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:49,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:49,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:49,284 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) [2025-04-29 11:20:49,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:20:49,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:20:49,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:20:49,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:49,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:49,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:20:49,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:49,454 INFO L354 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 [2025-04-29 11:20:49,458 INFO L354 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 [2025-04-29 11:20:49,467 INFO L354 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 [2025-04-29 11:20:49,478 INFO L354 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 [2025-04-29 11:20:49,520 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:20:49,521 INFO L354 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 [2025-04-29 11:20:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:49,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:49,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751968054] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:20:49,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:20:49,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2025-04-29 11:20:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337141391] [2025-04-29 11:20:49,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:49,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:20:49,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:49,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:20:49,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:20:49,662 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:49,904 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2025-04-29 11:20:49,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:20:49,904 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-29 11:20:49,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:49,904 INFO L225 Difference]: With dead ends: 83 [2025-04-29 11:20:49,904 INFO L226 Difference]: Without dead ends: 83 [2025-04-29 11:20:49,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:20:49,905 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:49,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 345 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:20:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-29 11:20:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-04-29 11:20:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2025-04-29 11:20:49,907 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 39 [2025-04-29 11:20:49,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:49,907 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2025-04-29 11:20:49,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:49,907 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2025-04-29 11:20:49,907 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:20:49,907 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:49,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:49,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:20:50,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:20:50,112 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:50,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash -43893094, now seen corresponding path program 1 times [2025-04-29 11:20:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:50,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574121910] [2025-04-29 11:20:50,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:50,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:50,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:20:50,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:20:50,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:50,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:50,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:50,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574121910] [2025-04-29 11:20:50,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574121910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:50,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:50,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:20:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570655608] [2025-04-29 11:20:50,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:50,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:20:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:50,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:20:50,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:20:50,324 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:50,460 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2025-04-29 11:20:50,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:20:50,460 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:20:50,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:50,461 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:20:50,461 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:20:50,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:20:50,461 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 52 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:50,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 373 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:20:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-04-29 11:20:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-04-29 11:20:50,465 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2025-04-29 11:20:50,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:50,465 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-04-29 11:20:50,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:50,465 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-04-29 11:20:50,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:20:50,465 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:50,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:50,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:20:50,465 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:50,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -43893542, now seen corresponding path program 1 times [2025-04-29 11:20:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:50,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419911355] [2025-04-29 11:20:50,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:50,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:20:50,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:20:50,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:50,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:20:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:50,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419911355] [2025-04-29 11:20:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419911355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:50,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521576684] [2025-04-29 11:20:50,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:50,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:50,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:50,609 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) [2025-04-29 11:20:50,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:20:50,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:20:50,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:20:50,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:50,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:50,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:20:50,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:50,764 INFO L354 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 [2025-04-29 11:20:50,805 INFO L325 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-04-29 11:20:50,806 INFO L354 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 [2025-04-29 11:20:50,827 INFO L354 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 [2025-04-29 11:20:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:20:50,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:20:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521576684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:50,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:20:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-04-29 11:20:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020663249] [2025-04-29 11:20:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:50,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:20:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:50,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:20:50,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:20:50,833 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:50,980 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-04-29 11:20:50,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:20:50,980 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:20:50,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:50,981 INFO L225 Difference]: With dead ends: 82 [2025-04-29 11:20:50,981 INFO L226 Difference]: Without dead ends: 82 [2025-04-29 11:20:50,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:20:50,981 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:50,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 204 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-29 11:20:50,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-29 11:20:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2025-04-29 11:20:50,984 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 41 [2025-04-29 11:20:50,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:50,984 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2025-04-29 11:20:50,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:50,984 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2025-04-29 11:20:50,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:20:50,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:50,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:50,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:20:51,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:20:51,184 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:51,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash -43893541, now seen corresponding path program 1 times [2025-04-29 11:20:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:51,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224166340] [2025-04-29 11:20:51,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:51,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:51,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:20:51,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:20:51,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:51,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:51,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:51,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224166340] [2025-04-29 11:20:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224166340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:51,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283860008] [2025-04-29 11:20:51,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:51,449 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) [2025-04-29 11:20:51,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:20:51,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:20:51,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:20:51,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:51,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:51,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:20:51,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:51,642 INFO L354 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 [2025-04-29 11:20:51,645 INFO L354 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 [2025-04-29 11:20:51,724 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:20:51,724 INFO L354 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 [2025-04-29 11:20:51,726 INFO L354 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 [2025-04-29 11:20:51,776 INFO L354 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 [2025-04-29 11:20:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:20:51,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:20:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283860008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:51,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:20:51,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2025-04-29 11:20:51,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138133303] [2025-04-29 11:20:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:51,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:20:51,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:51,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:20:51,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:20:51,812 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:51,959 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2025-04-29 11:20:51,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:20:51,959 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 11:20:51,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:51,960 INFO L225 Difference]: With dead ends: 84 [2025-04-29 11:20:51,960 INFO L226 Difference]: Without dead ends: 84 [2025-04-29 11:20:51,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:20:51,960 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:51,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 214 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-29 11:20:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-04-29 11:20:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2025-04-29 11:20:51,962 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2025-04-29 11:20:51,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:51,962 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2025-04-29 11:20:51,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:20:51,962 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2025-04-29 11:20:51,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:20:51,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:51,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:51,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:20:52,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:52,163 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-04-29 11:20:52,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash -323328839, now seen corresponding path program 1 times [2025-04-29 11:20:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:52,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238540171] [2025-04-29 11:20:52,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:52,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:20:52,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:20:52,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:52,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:52,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238540171] [2025-04-29 11:20:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238540171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:52,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103079470] [2025-04-29 11:20:52,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:52,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:52,681 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) [2025-04-29 11:20:52,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:20:52,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:20:52,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:20:52,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:52,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:52,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-29 11:20:52,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:52,846 INFO L354 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 [2025-04-29 11:20:52,879 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:20:52,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:20:52,903 INFO L354 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 13 treesize of output 9 [2025-04-29 11:20:52,924 INFO L354 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 29 treesize of output 13 [2025-04-29 11:20:52,940 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:20:52,940 INFO L354 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 42 treesize of output 41 [2025-04-29 11:20:53,032 INFO L325 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2025-04-29 11:20:53,033 INFO L354 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 40 treesize of output 69 [2025-04-29 11:20:53,075 INFO L354 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 68 treesize of output 51 [2025-04-29 11:20:53,090 INFO L354 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 68 treesize of output 51 [2025-04-29 11:20:53,102 INFO L354 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 68 treesize of output 51 [2025-04-29 11:20:53,265 INFO L325 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-04-29 11:20:53,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 60 [2025-04-29 11:20:53,363 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:20:53,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 98 [2025-04-29 11:20:53,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:20:53,437 INFO L354 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 105 treesize of output 82 [2025-04-29 11:20:53,548 INFO L354 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 164 treesize of output 116 [2025-04-29 11:20:53,550 INFO L354 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 115 treesize of output 87 [2025-04-29 11:20:53,708 INFO L354 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 93 treesize of output 51 [2025-04-29 11:20:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:53,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:54,096 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2692 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2692) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2025-04-29 11:20:58,103 WARN L849 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2692 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#0.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2692) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2025-04-29 11:21:02,444 INFO L354 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 47 treesize of output 39 [2025-04-29 11:21:02,446 INFO L354 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 35 Killed by 15