./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.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/dll2c_insert_equal.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 7fc7bbe9c8e24388ea6f64f6e0dd2dbb72e088c84a42ef20dafe6607e6e65c70 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:19:05,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:19:06,028 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:06,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:19:06,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:19:06,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:19:06,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:19:06,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:19:06,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:19:06,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:19:06,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:19:06,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:19:06,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:19:06,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:19:06,059 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:19:06,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:19:06,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:19:06,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:19:06,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:19:06,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:19:06,060 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:19:06,060 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:19:06,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:06,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:06,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:06,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:19:06,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:19:06,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:19:06,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:19:06,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:19:06,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:19:06,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:19:06,062 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 -> 7fc7bbe9c8e24388ea6f64f6e0dd2dbb72e088c84a42ef20dafe6607e6e65c70 [2025-04-29 11:19:06,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:19:06,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:19:06,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:19:06,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:19:06,301 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:19:06,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.c [2025-04-29 11:19:07,639 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245e6fd29/8de818547e4a4461ae8ad8f5eba46823/FLAG28458d030 [2025-04-29 11:19:07,895 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:19:07,896 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.c [2025-04-29 11:19:07,897 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:07,897 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:07,902 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245e6fd29/8de818547e4a4461ae8ad8f5eba46823/FLAG28458d030 [2025-04-29 11:19:08,840 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245e6fd29/8de818547e4a4461ae8ad8f5eba46823 [2025-04-29 11:19:08,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:19:08,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:19:08,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:08,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:19:08,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:19:08,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a69e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:08, skipping insertion in model container [2025-04-29 11:19:08,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:08" (1/1) ... [2025-04-29 11:19:08,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:19:09,037 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:09,044 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:19:09,084 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:09,099 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:19:09,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:09 WrapperNode [2025-04-29 11:19:09,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:09,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:09,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:19:09,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:19:09,105 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:09" (1/1) ... [2025-04-29 11:19:09,114 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:09" (1/1) ... [2025-04-29 11:19:09,139 INFO L138 Inliner]: procedures = 18, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2025-04-29 11:19:09,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:09,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:19:09,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:19:09,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:19:09,149 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:09" (1/1) ... [2025-04-29 11:19:09,150 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:09" (1/1) ... [2025-04-29 11:19:09,153 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:09" (1/1) ... [2025-04-29 11:19:09,178 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [11, 22]. 67 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 18 writes are split as follows [1, 17]. [2025-04-29 11:19:09,178 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:09" (1/1) ... [2025-04-29 11:19:09,179 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:09" (1/1) ... [2025-04-29 11:19:09,187 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:09" (1/1) ... [2025-04-29 11:19:09,188 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:09" (1/1) ... [2025-04-29 11:19:09,193 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:09" (1/1) ... [2025-04-29 11:19:09,194 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:09" (1/1) ... [2025-04-29 11:19:09,199 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:09" (1/1) ... [2025-04-29 11:19:09,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:19:09,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:19:09,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:19:09,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:19:09,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:09" (1/1) ... [2025-04-29 11:19:09,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:09,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:09,241 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:09,246 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:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:19:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:19:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:19:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:19:09,327 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:19:09,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:19:09,725 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-04-29 11:19:09,725 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:19:09,737 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:19:09,737 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:19:09,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:09 BoogieIcfgContainer [2025-04-29 11:19:09,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:19:09,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:19:09,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:19:09,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:19:09,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:19:08" (1/3) ... [2025-04-29 11:19:09,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4513a905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:09, skipping insertion in model container [2025-04-29 11:19:09,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:09" (2/3) ... [2025-04-29 11:19:09,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4513a905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:09, skipping insertion in model container [2025-04-29 11:19:09,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:09" (3/3) ... [2025-04-29 11:19:09,747 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.c [2025-04-29 11:19:09,760 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:19:09,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_equal.c that has 2 procedures, 154 locations, 170 edges, 1 initial locations, 4 loop locations, and 71 error locations. [2025-04-29 11:19:09,794 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:19:09,805 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;@9a3a308, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:19:09,806 INFO L341 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-04-29 11:19:09,809 INFO L278 IsEmpty]: Start isEmpty. Operand has 154 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 149 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:09,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:09,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:09,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:09,815 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:09,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 896011186, now seen corresponding path program 1 times [2025-04-29 11:19:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:09,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372671574] [2025-04-29 11:19:09,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:09,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:09,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:09,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:09,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:09,991 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:09,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:09,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372671574] [2025-04-29 11:19:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372671574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:09,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474756460] [2025-04-29 11:19:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:10,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:10,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:10,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:10,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:10,019 INFO L87 Difference]: Start difference. First operand has 154 states, 78 states have (on average 2.0641025641025643) internal successors, (161), 149 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:10,143 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2025-04-29 11:19:10,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:10,145 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:19:10,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:10,149 INFO L225 Difference]: With dead ends: 150 [2025-04-29 11:19:10,149 INFO L226 Difference]: Without dead ends: 146 [2025-04-29 11:19:10,150 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:10,156 INFO L437 NwaCegarLoop]: 152 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:10,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 236 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-29 11:19:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-04-29 11:19:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 74 states have (on average 2.0135135135135136) internal successors, (149), 141 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2025-04-29 11:19:10,189 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 6 [2025-04-29 11:19:10,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:10,190 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2025-04-29 11:19:10,190 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:10,190 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2025-04-29 11:19:10,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 11:19:10,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:10,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:19:10,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:19:10,192 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:10,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 896011187, now seen corresponding path program 1 times [2025-04-29 11:19:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:10,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502713381] [2025-04-29 11:19:10,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:10,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:19:10,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:19:10,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:10,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:10,336 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:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:10,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502713381] [2025-04-29 11:19:10,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502713381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094856535] [2025-04-29 11:19:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:10,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:10,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:10,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:10,339 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:10,436 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2025-04-29 11:19:10,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:10,436 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 11:19:10,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:10,437 INFO L225 Difference]: With dead ends: 143 [2025-04-29 11:19:10,437 INFO L226 Difference]: Without dead ends: 143 [2025-04-29 11:19:10,438 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:10,438 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:10,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 234 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-29 11:19:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-04-29 11:19:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 74 states have (on average 1.972972972972973) internal successors, (146), 138 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2025-04-29 11:19:10,444 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 6 [2025-04-29 11:19:10,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:10,444 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2025-04-29 11:19:10,444 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:19:10,444 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2025-04-29 11:19:10,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:19:10,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:10,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:10,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:19:10,445 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:10,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1000018881, now seen corresponding path program 1 times [2025-04-29 11:19:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:10,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455227333] [2025-04-29 11:19:10,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:10,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:10,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:19:10,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:19:10,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:10,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:10,529 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:10,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:10,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455227333] [2025-04-29 11:19:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455227333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:10,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:10,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315939278] [2025-04-29 11:19:10,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:10,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:10,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:10,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:10,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:10,531 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:19:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:10,545 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2025-04-29 11:19:10,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:10,547 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-04-29 11:19:10,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:10,548 INFO L225 Difference]: With dead ends: 154 [2025-04-29 11:19:10,548 INFO L226 Difference]: Without dead ends: 154 [2025-04-29 11:19:10,548 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:10,549 INFO L437 NwaCegarLoop]: 150 mSDtfsCounter, 10 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 295 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:10,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 295 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:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-29 11:19:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2025-04-29 11:19:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 75 states have (on average 1.96) internal successors, (147), 139 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2025-04-29 11:19:10,564 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 14 [2025-04-29 11:19:10,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:10,564 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2025-04-29 11:19:10,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:19:10,565 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2025-04-29 11:19:10,565 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:10,565 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:10,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:10,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:19:10,566 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:10,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1168669125, now seen corresponding path program 1 times [2025-04-29 11:19:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:10,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866547140] [2025-04-29 11:19:10,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:10,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:10,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:10,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:10,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:10,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:10,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866547140] [2025-04-29 11:19:10,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866547140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:10,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:10,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:10,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775626521] [2025-04-29 11:19:10,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:10,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:10,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:10,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:10,713 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:10,930 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2025-04-29 11:19:10,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:10,930 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-29 11:19:10,931 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:10,931 INFO L225 Difference]: With dead ends: 143 [2025-04-29 11:19:10,931 INFO L226 Difference]: Without dead ends: 143 [2025-04-29 11:19:10,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:10,932 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 7 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:10,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 430 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-29 11:19:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-04-29 11:19:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 138 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2025-04-29 11:19:10,938 INFO L79 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 24 [2025-04-29 11:19:10,938 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:10,938 INFO L485 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2025-04-29 11:19:10,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:10,938 INFO L278 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2025-04-29 11:19:10,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:19:10,939 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:10,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:10,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:19:10,939 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:10,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1168669126, now seen corresponding path program 1 times [2025-04-29 11:19:10,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:10,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600437861] [2025-04-29 11:19:10,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:10,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:19:10,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:19:10,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:10,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:11,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600437861] [2025-04-29 11:19:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600437861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:11,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979735970] [2025-04-29 11:19:11,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:11,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:11,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:11,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:11,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:11,119 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:11,300 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2025-04-29 11:19:11,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:11,301 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-04-29 11:19:11,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:11,302 INFO L225 Difference]: With dead ends: 142 [2025-04-29 11:19:11,302 INFO L226 Difference]: Without dead ends: 142 [2025-04-29 11:19:11,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:11,302 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:11,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 458 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-29 11:19:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-04-29 11:19:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2025-04-29 11:19:11,307 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 24 [2025-04-29 11:19:11,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:11,307 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2025-04-29 11:19:11,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:11,307 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2025-04-29 11:19:11,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:11,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:11,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:11,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:19:11,308 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:11,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2104564422, now seen corresponding path program 1 times [2025-04-29 11:19:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:11,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556098577] [2025-04-29 11:19:11,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:11,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:11,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:11,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:11,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:11,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:11,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556098577] [2025-04-29 11:19:11,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556098577] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:11,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207212397] [2025-04-29 11:19:11,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:11,558 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:11,560 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:11,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:11,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:11,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:11,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:19:11,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:11,667 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:11,696 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-29 11:19:11,756 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:19:11,756 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 19 treesize of output 16 [2025-04-29 11:19:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-29 11:19:11,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:11,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207212397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:11,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:11,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-04-29 11:19:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070489768] [2025-04-29 11:19:11,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:11,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:11,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:11,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-04-29 11:19:11,830 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:12,166 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2025-04-29 11:19:12,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:12,166 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-04-29 11:19:12,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:12,167 INFO L225 Difference]: With dead ends: 147 [2025-04-29 11:19:12,167 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:19:12,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-04-29 11:19:12,168 INFO L437 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:12,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 546 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 484 Invalid, 0 Unknown, 152 Unchecked, 0.3s Time] [2025-04-29 11:19:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:19:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-29 11:19:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 79 states have (on average 1.9113924050632911) internal successors, (151), 141 states have internal predecessors, (151), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2025-04-29 11:19:12,175 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 26 [2025-04-29 11:19:12,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:12,175 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2025-04-29 11:19:12,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:12,175 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2025-04-29 11:19:12,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 11:19:12,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:12,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:12,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:19:12,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 11:19:12,380 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:12,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2104564423, now seen corresponding path program 1 times [2025-04-29 11:19:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:12,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933921526] [2025-04-29 11:19:12,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:12,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:12,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:12,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:12,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:12,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933921526] [2025-04-29 11:19:12,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933921526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:12,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021537455] [2025-04-29 11:19:12,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:12,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:12,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:12,648 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:12,649 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:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 11:19:12,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 11:19:12,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:12,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:12,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:19:12,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:12,744 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:12,748 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:12,949 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:12,949 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:12,955 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:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:13,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:13,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021537455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:13,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:13,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2025-04-29 11:19:13,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800355108] [2025-04-29 11:19:13,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:13,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:19:13,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:13,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:19:13,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:19:13,129 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:13,758 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2025-04-29 11:19:13,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:19:13,758 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-04-29 11:19:13,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:13,759 INFO L225 Difference]: With dead ends: 147 [2025-04-29 11:19:13,759 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:19:13,760 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:19:13,760 INFO L437 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:13,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 911 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-29 11:19:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:19:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-29 11:19:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 79 states have (on average 1.8987341772151898) internal successors, (150), 141 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2025-04-29 11:19:13,765 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 26 [2025-04-29 11:19:13,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:13,765 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2025-04-29 11:19:13,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:13,765 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2025-04-29 11:19:13,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:19:13,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:13,766 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] [2025-04-29 11:19:13,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:19:13,966 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,SelfDestructingSolverStorable6 [2025-04-29 11:19:13,967 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:13,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -443032312, now seen corresponding path program 1 times [2025-04-29 11:19:13,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:13,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977673669] [2025-04-29 11:19:13,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:13,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:13,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:13,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:13,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:14,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977673669] [2025-04-29 11:19:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977673669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:14,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028859978] [2025-04-29 11:19:14,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:14,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:14,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:14,050 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:14,052 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:14,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:19:14,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:19:14,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:14,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:19:14,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:14,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:14,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028859978] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:14,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:14,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-04-29 11:19:14,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706262377] [2025-04-29 11:19:14,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:14,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:14,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:14,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:14,180 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:14,221 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2025-04-29 11:19:14,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:14,222 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-04-29 11:19:14,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:14,223 INFO L225 Difference]: With dead ends: 147 [2025-04-29 11:19:14,223 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:19:14,223 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:14,224 INFO L437 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:14,224 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 689 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:19:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-04-29 11:19:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 79 states have (on average 1.8860759493670887) internal successors, (149), 141 states have internal predecessors, (149), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2025-04-29 11:19:14,230 INFO L79 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 28 [2025-04-29 11:19:14,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:14,231 INFO L485 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2025-04-29 11:19:14,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:14,231 INFO L278 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2025-04-29 11:19:14,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:14,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:14,234 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] [2025-04-29 11:19:14,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:14,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:14,435 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:14,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:14,435 INFO L85 PathProgramCache]: Analyzing trace with hash -853898092, now seen corresponding path program 1 times [2025-04-29 11:19:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:14,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573708798] [2025-04-29 11:19:14,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:14,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:14,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:14,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:14,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:14,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:14,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573708798] [2025-04-29 11:19:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573708798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:14,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546298328] [2025-04-29 11:19:14,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:14,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:14,498 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:14,499 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:14,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:14,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:14,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:14,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:14,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 11:19:14,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:14,604 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:14,645 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-29 11:19:14,682 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:19:14,683 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 19 treesize of output 16 [2025-04-29 11:19:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-04-29 11:19:14,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:14,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546298328] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:14,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:14,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-04-29 11:19:14,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269158434] [2025-04-29 11:19:14,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:14,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:19:14,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:14,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:19:14,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-04-29 11:19:14,735 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:14,971 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2025-04-29 11:19:14,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:14,972 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-04-29 11:19:14,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:14,972 INFO L225 Difference]: With dead ends: 146 [2025-04-29 11:19:14,973 INFO L226 Difference]: Without dead ends: 146 [2025-04-29 11:19:14,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-04-29 11:19:14,973 INFO L437 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:14,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 547 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 469 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2025-04-29 11:19:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-29 11:19:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-04-29 11:19:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 140 states have internal predecessors, (148), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:19:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2025-04-29 11:19:14,977 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 29 [2025-04-29 11:19:14,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:14,977 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2025-04-29 11:19:14,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:14,977 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2025-04-29 11:19:14,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 11:19:14,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:14,977 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] [2025-04-29 11:19:14,985 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:15,178 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:15,178 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:15,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash -853898091, now seen corresponding path program 1 times [2025-04-29 11:19:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:15,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021251176] [2025-04-29 11:19:15,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:15,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:15,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:15,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:15,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:15,312 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:15,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:15,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021251176] [2025-04-29 11:19:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021251176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:15,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562617505] [2025-04-29 11:19:15,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:15,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:15,315 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:15,317 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:19:15,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:19:15,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:19:15,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:15,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:15,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:19:15,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:15,408 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:15,411 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:15,504 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-29 11:19:15,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:15,535 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:15,542 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:15,542 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:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-29 11:19:15,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562617505] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:15,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-04-29 11:19:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145335177] [2025-04-29 11:19:15,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:15,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:19:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:15,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:19:15,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-04-29 11:19:15,654 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:16,027 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2025-04-29 11:19:16,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:19:16,027 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-04-29 11:19:16,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:16,029 INFO L225 Difference]: With dead ends: 163 [2025-04-29 11:19:16,029 INFO L226 Difference]: Without dead ends: 163 [2025-04-29 11:19:16,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-04-29 11:19:16,030 INFO L437 NwaCegarLoop]: 133 mSDtfsCounter, 24 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:16,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 861 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 619 Invalid, 0 Unknown, 171 Unchecked, 0.3s Time] [2025-04-29 11:19:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-29 11:19:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2025-04-29 11:19:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 88 states have (on average 1.8409090909090908) internal successors, (162), 149 states have internal predecessors, (162), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:19:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2025-04-29 11:19:16,034 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 29 [2025-04-29 11:19:16,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:16,034 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2025-04-29 11:19:16,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-04-29 11:19:16,034 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2025-04-29 11:19:16,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:16,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:16,035 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] [2025-04-29 11:19:16,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:16,239 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,SelfDestructingSolverStorable9 [2025-04-29 11:19:16,239 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:16,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -701037077, now seen corresponding path program 1 times [2025-04-29 11:19:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:16,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962626497] [2025-04-29 11:19:16,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:16,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:16,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:16,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:16,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:16,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:16,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962626497] [2025-04-29 11:19:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962626497] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:16,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346105917] [2025-04-29 11:19:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:16,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:16,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:16,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:16,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:16,344 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:16,524 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2025-04-29 11:19:16,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:16,525 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-29 11:19:16,525 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:16,525 INFO L225 Difference]: With dead ends: 155 [2025-04-29 11:19:16,525 INFO L226 Difference]: Without dead ends: 155 [2025-04-29 11:19:16,526 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:16,526 INFO L437 NwaCegarLoop]: 137 mSDtfsCounter, 7 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:16,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 488 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-29 11:19:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-04-29 11:19:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 88 states have (on average 1.8295454545454546) internal successors, (161), 148 states have internal predecessors, (161), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:19:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2025-04-29 11:19:16,534 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 30 [2025-04-29 11:19:16,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:16,535 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2025-04-29 11:19:16,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:16,535 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2025-04-29 11:19:16,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:16,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:16,536 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] [2025-04-29 11:19:16,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:19:16,536 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:16,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -701037076, now seen corresponding path program 1 times [2025-04-29 11:19:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:16,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543243432] [2025-04-29 11:19:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:16,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:16,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:16,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:16,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:16,679 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:19:16,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:16,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543243432] [2025-04-29 11:19:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543243432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:16,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:19:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387854449] [2025-04-29 11:19:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:16,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:16,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:16,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:16,682 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:16,867 INFO L93 Difference]: Finished difference Result 154 states and 170 transitions. [2025-04-29 11:19:16,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:16,867 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-04-29 11:19:16,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:16,869 INFO L225 Difference]: With dead ends: 154 [2025-04-29 11:19:16,869 INFO L226 Difference]: Without dead ends: 154 [2025-04-29 11:19:16,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:16,870 INFO L437 NwaCegarLoop]: 136 mSDtfsCounter, 6 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:16,870 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 518 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-29 11:19:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-04-29 11:19:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 88 states have (on average 1.8181818181818181) internal successors, (160), 147 states have internal predecessors, (160), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:19:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2025-04-29 11:19:16,875 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 30 [2025-04-29 11:19:16,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:16,875 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2025-04-29 11:19:16,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:19:16,875 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2025-04-29 11:19:16,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 11:19:16,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:16,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:16,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:19:16,878 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:16,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash -914690279, now seen corresponding path program 1 times [2025-04-29 11:19:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:16,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720051340] [2025-04-29 11:19:16,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:16,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:16,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:16,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:16,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 11:19:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:16,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720051340] [2025-04-29 11:19:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720051340] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:16,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725465014] [2025-04-29 11:19:16,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:16,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:16,955 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:19:16,957 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:19:17,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:19:17,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:19:17,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:17,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:19:17,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:17,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725465014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-04-29 11:19:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686216233] [2025-04-29 11:19:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:17,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:17,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:17,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:17,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:17,091 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:17,105 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2025-04-29 11:19:17,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:17,105 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-04-29 11:19:17,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:17,106 INFO L225 Difference]: With dead ends: 136 [2025-04-29 11:19:17,106 INFO L226 Difference]: Without dead ends: 136 [2025-04-29 11:19:17,106 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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:17,107 INFO L437 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 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:19:17,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-29 11:19:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-04-29 11:19:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 131 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2025-04-29 11:19:17,109 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 41 [2025-04-29 11:19:17,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:17,109 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2025-04-29 11:19:17,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:17,110 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2025-04-29 11:19:17,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:17,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:17,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:17,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:17,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:17,311 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:17,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1851861434, now seen corresponding path program 1 times [2025-04-29 11:19:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:17,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343736738] [2025-04-29 11:19:17,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:17,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:17,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:17,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:17,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:17,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343736738] [2025-04-29 11:19:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343736738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:17,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663774075] [2025-04-29 11:19:17,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:17,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:17,682 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:19:17,684 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:19:17,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:17,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:17,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:17,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:17,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:19:17,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:17,812 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:17,821 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 5 treesize of output 3 [2025-04-29 11:19:17,859 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:17,859 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:19:17,915 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 9 treesize of output 7 [2025-04-29 11:19:17,922 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-04-29 11:19:17,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:17,971 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:19:18,051 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 5 treesize of output 3 [2025-04-29 11:19:18,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:18,091 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:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2025-04-29 11:19:18,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663774075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:18,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:18,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2025-04-29 11:19:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664353722] [2025-04-29 11:19:18,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:18,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:19:18,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:18,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:19:18,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=287, Unknown=1, NotChecked=34, Total=380 [2025-04-29 11:19:18,144 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand has 19 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:19:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:18,631 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2025-04-29 11:19:18,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:19:18,632 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2025-04-29 11:19:18,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:18,633 INFO L225 Difference]: With dead ends: 145 [2025-04-29 11:19:18,633 INFO L226 Difference]: Without dead ends: 145 [2025-04-29 11:19:18,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=382, Unknown=1, NotChecked=40, Total=506 [2025-04-29 11:19:18,635 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 161 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:18,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 476 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 701 Invalid, 0 Unknown, 146 Unchecked, 0.4s Time] [2025-04-29 11:19:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-04-29 11:19:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2025-04-29 11:19:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 121 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2025-04-29 11:19:18,640 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 43 [2025-04-29 11:19:18,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:18,641 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2025-04-29 11:19:18,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:19:18,641 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2025-04-29 11:19:18,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:19:18,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:18,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:18,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:19:18,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:18,842 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:18,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:18,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1851861433, now seen corresponding path program 1 times [2025-04-29 11:19:18,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:18,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949643696] [2025-04-29 11:19:18,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:18,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:19:18,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:19:18,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:18,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:19:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:19,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949643696] [2025-04-29 11:19:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949643696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:19:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653601928] [2025-04-29 11:19:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:19,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:19:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:19,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:19:19,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:19:19,153 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:19,328 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2025-04-29 11:19:19,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:19,328 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-04-29 11:19:19,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:19,329 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:19:19,329 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:19:19,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:19:19,329 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 122 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:19,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 228 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:19:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:19:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-04-29 11:19:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 75 states have (on average 1.56) internal successors, (117), 111 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2025-04-29 11:19:19,332 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 43 [2025-04-29 11:19:19,332 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:19,332 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2025-04-29 11:19:19,332 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:19,333 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2025-04-29 11:19:19,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:19,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:19,333 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:19,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:19:19,333 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:19,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:19,334 INFO L85 PathProgramCache]: Analyzing trace with hash 50946885, now seen corresponding path program 1 times [2025-04-29 11:19:19,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:19,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078993096] [2025-04-29 11:19:19,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:19,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:19,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:19,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:19,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:19,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:19,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078993096] [2025-04-29 11:19:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078993096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:19,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026646291] [2025-04-29 11:19:19,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:19,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:19,624 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:19:19,626 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:19:19,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:19,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:19,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:19,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:19,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-29 11:19:19,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:19,868 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 9 treesize of output 3 [2025-04-29 11:19:19,872 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-04-29 11:19:19,893 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:19:19,893 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 16 treesize of output 18 [2025-04-29 11:19:19,915 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:19:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:19,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:19,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026646291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:19,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:19,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-04-29 11:19:19,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840826824] [2025-04-29 11:19:19,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:19,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:19,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:19,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-04-29 11:19:19,920 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:20,146 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2025-04-29 11:19:20,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:19:20,146 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-04-29 11:19:20,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:20,147 INFO L225 Difference]: With dead ends: 160 [2025-04-29 11:19:20,147 INFO L226 Difference]: Without dead ends: 160 [2025-04-29 11:19:20,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-04-29 11:19:20,148 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 140 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:20,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 341 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 238 Unchecked, 0.2s Time] [2025-04-29 11:19:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-04-29 11:19:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2025-04-29 11:19:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 118 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2025-04-29 11:19:20,154 INFO L79 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 46 [2025-04-29 11:19:20,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:20,154 INFO L485 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2025-04-29 11:19:20,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:20,154 INFO L278 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2025-04-29 11:19:20,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:20,157 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:20,157 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:20,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:20,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:19:20,358 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:20,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash 50946886, now seen corresponding path program 1 times [2025-04-29 11:19:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:20,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632193412] [2025-04-29 11:19:20,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:20,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:20,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:20,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:20,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:20,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:20,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632193412] [2025-04-29 11:19:20,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632193412] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:20,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425600463] [2025-04-29 11:19:20,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:20,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:20,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:20,758 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:19:20,760 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:19:20,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:21,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:21,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:21,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:21,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-04-29 11:19:21,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:21,175 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:21,178 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:21,372 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:21,373 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:21,382 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 12 treesize of output 14 [2025-04-29 11:19:21,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:19:21,719 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 9 treesize of output 3 [2025-04-29 11:19:21,754 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 0) 0))) is different from true [2025-04-29 11:19:21,794 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:19:21,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-04-29 11:19:21,805 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:21,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2025-04-29 11:19:21,861 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:19:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2025-04-29 11:19:21,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425600463] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:22,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2025-04-29 11:19:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066227686] [2025-04-29 11:19:22,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:22,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:19:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:22,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:19:22,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1222, Unknown=1, NotChecked=70, Total=1406 [2025-04-29 11:19:22,117 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 33 states, 30 states have (on average 2.6) internal successors, (78), 27 states have internal predecessors, (78), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:19:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,202 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2025-04-29 11:19:23,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:19:23,203 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6) internal successors, (78), 27 states have internal predecessors, (78), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2025-04-29 11:19:23,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,203 INFO L225 Difference]: With dead ends: 168 [2025-04-29 11:19:23,203 INFO L226 Difference]: Without dead ends: 168 [2025-04-29 11:19:23,204 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=2145, Unknown=1, NotChecked=94, Total=2450 [2025-04-29 11:19:23,204 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 261 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:23,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1274 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1777 Invalid, 0 Unknown, 170 Unchecked, 0.8s Time] [2025-04-29 11:19:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-29 11:19:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2025-04-29 11:19:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 89 states have (on average 1.5617977528089888) internal successors, (139), 125 states have internal predecessors, (139), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2025-04-29 11:19:23,208 INFO L79 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 46 [2025-04-29 11:19:23,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,209 INFO L485 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2025-04-29 11:19:23,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6) internal successors, (78), 27 states have internal predecessors, (78), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-04-29 11:19:23,209 INFO L278 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2025-04-29 11:19:23,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:19:23,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,210 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:23,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:19:23,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:19:23,411 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:23,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1579359473, now seen corresponding path program 1 times [2025-04-29 11:19:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118207499] [2025-04-29 11:19:23,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:19:23,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:19:23,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:19:23,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:23,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118207499] [2025-04-29 11:19:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118207499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:23,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15408956] [2025-04-29 11:19:23,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:23,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:23,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:23,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:23,452 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,462 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2025-04-29 11:19:23,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:23,462 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-04-29 11:19:23,463 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,463 INFO L225 Difference]: With dead ends: 127 [2025-04-29 11:19:23,464 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 11:19:23,464 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:23,464 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 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:19:23,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 11:19:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-04-29 11:19:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 121 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2025-04-29 11:19:23,468 INFO L79 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 47 [2025-04-29 11:19:23,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,468 INFO L485 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2025-04-29 11:19:23,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:23,468 INFO L278 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2025-04-29 11:19:23,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:19:23,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:23,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:19:23,469 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:23,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1641430930, now seen corresponding path program 1 times [2025-04-29 11:19:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948979745] [2025-04-29 11:19:23,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:19:23,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:19:23,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 11:19:23,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:23,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948979745] [2025-04-29 11:19:23,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948979745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:23,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610427196] [2025-04-29 11:19:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:23,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:23,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:23,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:23,539 INFO L87 Difference]: Start difference. First operand 127 states and 134 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,668 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2025-04-29 11:19:23,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:23,668 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-04-29 11:19:23,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,669 INFO L225 Difference]: With dead ends: 121 [2025-04-29 11:19:23,669 INFO L226 Difference]: Without dead ends: 121 [2025-04-29 11:19:23,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:23,670 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 33 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:23,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 280 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-29 11:19:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-04-29 11:19:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 115 states have internal predecessors, (122), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2025-04-29 11:19:23,672 INFO L79 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 49 [2025-04-29 11:19:23,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,673 INFO L485 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2025-04-29 11:19:23,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:23,674 INFO L278 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2025-04-29 11:19:23,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:19:23,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:23,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:19:23,674 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:23,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1641430931, now seen corresponding path program 1 times [2025-04-29 11:19:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039305858] [2025-04-29 11:19:23,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:19:23,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:19:23,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:19:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:23,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039305858] [2025-04-29 11:19:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039305858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:19:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103416200] [2025-04-29 11:19:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:23,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:23,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:23,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:23,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:19:23,776 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,788 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2025-04-29 11:19:23,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:23,789 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-04-29 11:19:23,789 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,789 INFO L225 Difference]: With dead ends: 120 [2025-04-29 11:19:23,789 INFO L226 Difference]: Without dead ends: 120 [2025-04-29 11:19:23,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:23,791 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 67 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:23,791 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-29 11:19:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-04-29 11:19:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 114 states have internal predecessors, (120), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2025-04-29 11:19:23,797 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 49 [2025-04-29 11:19:23,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,797 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2025-04-29 11:19:23,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:23,797 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2025-04-29 11:19:23,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 11:19:23,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-04-29 11:19:23,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:19:23,798 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:23,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1635213294, now seen corresponding path program 1 times [2025-04-29 11:19:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119073626] [2025-04-29 11:19:23,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:19:23,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:19:23,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:19:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:23,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119073626] [2025-04-29 11:19:23,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119073626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:23,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:23,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:23,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709027208] [2025-04-29 11:19:23,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:23,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:23,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:23,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:23,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:23,896 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:23,915 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2025-04-29 11:19:23,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:19:23,915 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-04-29 11:19:23,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:23,916 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:19:23,916 INFO L226 Difference]: Without dead ends: 117 [2025-04-29 11:19:23,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:23,916 INFO L437 NwaCegarLoop]: 110 mSDtfsCounter, 60 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:23,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-29 11:19:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-04-29 11:19:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2025-04-29 11:19:23,919 INFO L79 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 49 [2025-04-29 11:19:23,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:23,919 INFO L485 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2025-04-29 11:19:23,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-29 11:19:23,920 INFO L278 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2025-04-29 11:19:23,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:19:23,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:23,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:23,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:19:23,920 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:23,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash -847989400, now seen corresponding path program 1 times [2025-04-29 11:19:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:23,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046457623] [2025-04-29 11:19:23,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:23,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:23,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:23,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:23,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:19:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:23,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046457623] [2025-04-29 11:19:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046457623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453233214] [2025-04-29 11:19:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:23,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:23,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:23,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:19:23,973 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:24,044 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2025-04-29 11:19:24,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:24,046 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-04-29 11:19:24,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:24,047 INFO L225 Difference]: With dead ends: 116 [2025-04-29 11:19:24,047 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:19:24,047 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:19:24,048 INFO L437 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:24,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 220 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:19:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-04-29 11:19:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 110 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2025-04-29 11:19:24,052 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 50 [2025-04-29 11:19:24,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:24,052 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2025-04-29 11:19:24,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:24,053 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2025-04-29 11:19:24,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:19:24,053 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:24,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:24,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:19:24,053 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:24,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -847989399, now seen corresponding path program 1 times [2025-04-29 11:19:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:24,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940429416] [2025-04-29 11:19:24,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:24,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:24,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:24,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:24,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:24,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940429416] [2025-04-29 11:19:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940429416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:24,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184602056] [2025-04-29 11:19:24,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:24,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:24,561 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:19:24,563 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:19:24,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:24,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:24,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:19:24,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:24,940 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:19:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:19:24,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184602056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:24,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 19 [2025-04-29 11:19:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928776995] [2025-04-29 11:19:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:24,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:19:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:24,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:19:24,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:19:24,978 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:25,035 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2025-04-29 11:19:25,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:25,036 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-04-29 11:19:25,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:25,036 INFO L225 Difference]: With dead ends: 115 [2025-04-29 11:19:25,036 INFO L226 Difference]: Without dead ends: 115 [2025-04-29 11:19:25,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:19:25,037 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:25,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 262 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-29 11:19:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-04-29 11:19:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2025-04-29 11:19:25,039 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 50 [2025-04-29 11:19:25,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:25,039 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2025-04-29 11:19:25,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:25,039 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2025-04-29 11:19:25,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:19:25,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:25,040 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:25,048 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:19:25,240 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,SelfDestructingSolverStorable22 [2025-04-29 11:19:25,241 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:25,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash -517867596, now seen corresponding path program 1 times [2025-04-29 11:19:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:25,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867442727] [2025-04-29 11:19:25,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:25,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-29 11:19:25,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-29 11:19:25,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:25,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:19:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:25,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867442727] [2025-04-29 11:19:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867442727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230838893] [2025-04-29 11:19:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:25,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:25,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:25,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:25,364 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:25,467 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2025-04-29 11:19:25,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:25,467 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-04-29 11:19:25,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:25,468 INFO L225 Difference]: With dead ends: 109 [2025-04-29 11:19:25,468 INFO L226 Difference]: Without dead ends: 109 [2025-04-29 11:19:25,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:25,468 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 26 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:25,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 300 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-29 11:19:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-29 11:19:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2025-04-29 11:19:25,472 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 51 [2025-04-29 11:19:25,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:25,472 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2025-04-29 11:19:25,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-04-29 11:19:25,472 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2025-04-29 11:19:25,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:19:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:25,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:25,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:19:25,473 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:25,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash 545446582, now seen corresponding path program 1 times [2025-04-29 11:19:25,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:25,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180612503] [2025-04-29 11:19:25,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:25,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:25,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:25,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:25,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:26,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180612503] [2025-04-29 11:19:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180612503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:26,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743590733] [2025-04-29 11:19:26,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:26,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:26,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:26,361 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:19:26,362 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:19:26,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:26,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:26,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:26,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:26,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-04-29 11:19:26,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:26,679 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:26,863 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:19:26,864 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:19:26,940 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:19:26,992 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:19:26,992 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 41 treesize of output 38 [2025-04-29 11:19:27,080 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:19:27,080 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-04-29 11:19:27,120 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 33 treesize of output 24 [2025-04-29 11:19:27,247 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-04-29 11:19:27,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:19:27,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:27,443 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 57 treesize of output 34 [2025-04-29 11:19:27,464 INFO L325 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-04-29 11:19:27,464 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 36 treesize of output 52 [2025-04-29 11:19:27,599 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 85 treesize of output 49 [2025-04-29 11:19:27,610 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:27,612 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:19:27,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:27,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:27,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2025-04-29 11:19:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:28,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743590733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:28,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:28,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 54 [2025-04-29 11:19:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963091102] [2025-04-29 11:19:28,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:28,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-29 11:19:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:28,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-29 11:19:28,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3816, Unknown=0, NotChecked=0, Total=4032 [2025-04-29 11:19:28,543 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 55 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:19:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:30,542 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2025-04-29 11:19:30,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-29 11:19:30,542 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2025-04-29 11:19:30,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:30,543 INFO L225 Difference]: With dead ends: 110 [2025-04-29 11:19:30,543 INFO L226 Difference]: Without dead ends: 110 [2025-04-29 11:19:30,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=449, Invalid=6357, Unknown=0, NotChecked=0, Total=6806 [2025-04-29 11:19:30,544 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 168 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:30,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1502 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-29 11:19:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-29 11:19:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-04-29 11:19:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2025-04-29 11:19:30,547 INFO L79 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 53 [2025-04-29 11:19:30,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:30,547 INFO L485 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2025-04-29 11:19:30,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:19:30,548 INFO L278 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2025-04-29 11:19:30,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:19:30,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:30,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:30,568 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:19:30,748 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,SelfDestructingSolverStorable24 [2025-04-29 11:19:30,749 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:30,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash 545446583, now seen corresponding path program 1 times [2025-04-29 11:19:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:30,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810104786] [2025-04-29 11:19:30,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:30,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:30,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:30,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:30,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:31,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:31,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810104786] [2025-04-29 11:19:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810104786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:31,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997476999] [2025-04-29 11:19:31,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:31,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:31,959 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:19:31,960 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:19:32,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:32,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:32,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-04-29 11:19:32,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:32,316 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:32,318 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:32,579 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:19:32,580 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:19:32,597 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:19:32,597 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:19:32,702 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:19:32,706 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:19:32,795 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:19:32,795 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 66 treesize of output 57 [2025-04-29 11:19:32,800 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:19:32,937 INFO L325 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-04-29 11:19:32,937 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 31 [2025-04-29 11:19:32,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:32,945 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 16 treesize of output 11 [2025-04-29 11:19:32,983 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 42 treesize of output 29 [2025-04-29 11:19:32,993 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 19 treesize of output 18 [2025-04-29 11:19:33,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2025-04-29 11:19:33,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:19:33,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-04-29 11:19:33,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-29 11:19:33,342 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (<= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-04-29 11:19:33,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:33,368 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 70 treesize of output 41 [2025-04-29 11:19:33,382 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 11:19:33,383 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:19:33,388 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:19:33,391 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 31 treesize of output 20 [2025-04-29 11:19:33,462 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 46 [2025-04-29 11:19:33,477 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:33,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:19:33,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:33,626 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:33,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 24 [2025-04-29 11:19:33,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:33,633 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:33,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:19:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-29 11:19:33,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997476999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:34,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 54 [2025-04-29 11:19:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910893714] [2025-04-29 11:19:34,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:34,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-29 11:19:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:34,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-29 11:19:34,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3592, Unknown=1, NotChecked=120, Total=3906 [2025-04-29 11:19:34,352 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 55 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:19:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:36,753 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2025-04-29 11:19:36,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-29 11:19:36,753 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2025-04-29 11:19:36,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:36,754 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:19:36,754 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:19:36,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=395, Invalid=6088, Unknown=1, NotChecked=158, Total=6642 [2025-04-29 11:19:36,755 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 114 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 2656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:36,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1752 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2539 Invalid, 0 Unknown, 110 Unchecked, 1.2s Time] [2025-04-29 11:19:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:19:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-04-29 11:19:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2025-04-29 11:19:36,757 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 53 [2025-04-29 11:19:36,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:36,757 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2025-04-29 11:19:36,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 47 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:19:36,758 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2025-04-29 11:19:36,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:19:36,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,767 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:19:36,958 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,SelfDestructingSolverStorable25 [2025-04-29 11:19:36,959 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:36,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 431128891, now seen corresponding path program 1 times [2025-04-29 11:19:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373061371] [2025-04-29 11:19:36,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:19:36,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:19:36,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 11:19:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:37,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373061371] [2025-04-29 11:19:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373061371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:37,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954138241] [2025-04-29 11:19:37,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:37,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:37,103 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:19:37,104 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:19:37,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:19:37,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:19:37,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:19:37,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:37,315 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:37,388 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 9 treesize of output 3 [2025-04-29 11:19:37,402 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-04-29 11:19:37,420 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:19:37,420 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 16 treesize of output 18 [2025-04-29 11:19:37,448 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:19:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-04-29 11:19:37,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:37,556 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 18 treesize of output 10 [2025-04-29 11:19:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:19:37,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954138241] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:37,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:37,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 16 [2025-04-29 11:19:37,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983819918] [2025-04-29 11:19:37,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:37,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:19:37,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:37,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:19:37,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=211, Unknown=1, NotChecked=28, Total=272 [2025-04-29 11:19:37,588 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:19:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:37,920 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2025-04-29 11:19:37,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:19:37,921 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2025-04-29 11:19:37,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:37,921 INFO L225 Difference]: With dead ends: 121 [2025-04-29 11:19:37,921 INFO L226 Difference]: Without dead ends: 121 [2025-04-29 11:19:37,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=445, Unknown=1, NotChecked=42, Total=552 [2025-04-29 11:19:37,922 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 73 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:37,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 619 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 753 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2025-04-29 11:19:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-29 11:19:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2025-04-29 11:19:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.264367816091954) internal successors, (110), 104 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2025-04-29 11:19:37,924 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 57 [2025-04-29 11:19:37,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:37,924 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2025-04-29 11:19:37,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.5625) internal successors, (73), 15 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:19:37,924 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2025-04-29 11:19:37,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:19:37,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:37,924 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:37,931 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:19:38,129 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,SelfDestructingSolverStorable26 [2025-04-29 11:19:38,129 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:38,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash 431128892, now seen corresponding path program 1 times [2025-04-29 11:19:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:38,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584160676] [2025-04-29 11:19:38,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:38,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:38,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:19:38,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:19:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:38,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:38,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584160676] [2025-04-29 11:19:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584160676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:38,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815332740] [2025-04-29 11:19:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:38,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:38,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:38,658 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:19:38,659 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:19:38,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:19:38,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:19:38,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:38,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:38,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-29 11:19:38,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:38,851 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:38,855 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:39,030 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 9 treesize of output 3 [2025-04-29 11:19:39,033 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 9 treesize of output 3 [2025-04-29 11:19:39,069 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_11|) 0))) is different from true [2025-04-29 11:19:39,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:39,094 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:19:39,099 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:19:39,099 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:19:39,148 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:19:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2025-04-29 11:19:39,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:39,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815332740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:39,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:39,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 28 [2025-04-29 11:19:39,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365747780] [2025-04-29 11:19:39,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:39,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:19:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:39,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:19:39,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=906, Unknown=1, NotChecked=60, Total=1056 [2025-04-29 11:19:39,319 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 29 states, 26 states have (on average 3.269230769230769) internal successors, (85), 25 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 11:19:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:40,098 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2025-04-29 11:19:40,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:19:40,098 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.269230769230769) internal successors, (85), 25 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-04-29 11:19:40,098 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:40,099 INFO L225 Difference]: With dead ends: 123 [2025-04-29 11:19:40,099 INFO L226 Difference]: Without dead ends: 123 [2025-04-29 11:19:40,099 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=1729, Unknown=1, NotChecked=84, Total=1980 [2025-04-29 11:19:40,099 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 113 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:40,100 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 976 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1469 Invalid, 0 Unknown, 122 Unchecked, 0.5s Time] [2025-04-29 11:19:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-29 11:19:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2025-04-29 11:19:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.247191011235955) internal successors, (111), 106 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:19:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2025-04-29 11:19:40,102 INFO L79 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 57 [2025-04-29 11:19:40,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:40,102 INFO L485 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2025-04-29 11:19:40,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.269230769230769) internal successors, (85), 25 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-29 11:19:40,102 INFO L278 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2025-04-29 11:19:40,102 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:19:40,102 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:40,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:40,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:19:40,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:40,303 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:19:40,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1589345102, now seen corresponding path program 1 times [2025-04-29 11:19:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:40,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118355841] [2025-04-29 11:19:40,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:40,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:19:40,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:19:40,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:40,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:40,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118355841] [2025-04-29 11:19:40,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118355841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:40,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252355572] [2025-04-29 11:19:40,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:40,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:40,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:40,482 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:19:40,484 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:19:40,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:19:40,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:19:40,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:40,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:19:40,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:40,829 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:19:40,830 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:40,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:19:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:40,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:40,907 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:19:40,907 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-04-29 11:19:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252355572] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:41,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 27 [2025-04-29 11:19:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462099394] [2025-04-29 11:19:41,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:41,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:19:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:41,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:19:41,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:19:41,043 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 24 states have internal predecessors, (85), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 11:19:45,060 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:19:49,069 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:19:53,080 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:19:57,112 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:20:01,124 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:20:05,140 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:20:09,150 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:20:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:09,381 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2025-04-29 11:20:09,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:20:09,381 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 24 states have internal predecessors, (85), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 58 [2025-04-29 11:20:09,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:09,381 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:20:09,381 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:20:09,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:20:09,382 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 107 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:09,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 965 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 513 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2025-04-29 11:20:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:20:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-29 11:20:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 11:20:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2025-04-29 11:20:09,384 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 58 [2025-04-29 11:20:09,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:09,384 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2025-04-29 11:20:09,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 24 states have internal predecessors, (85), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-04-29 11:20:09,384 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2025-04-29 11:20:09,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-04-29 11:20:09,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:09,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:09,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:20:09,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:20:09,589 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2025-04-29 11:20:09,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1904356204, now seen corresponding path program 1 times [2025-04-29 11:20:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:09,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783902252] [2025-04-29 11:20:09,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:09,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:20:09,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:20:09,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:09,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:10,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783902252] [2025-04-29 11:20:10,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783902252] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:10,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976003376] [2025-04-29 11:20:10,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:10,861 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:20:10,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:20:11,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-29 11:20:11,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-29 11:20:11,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:11,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:11,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-29 11:20:11,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:11,095 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:11,184 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:20:11,184 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:20:11,255 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:11,297 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 16 treesize of output 11 [2025-04-29 11:20:11,369 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 16 treesize of output 11 [2025-04-29 11:20:11,407 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 35 treesize of output 26 [2025-04-29 11:20:11,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 17 [2025-04-29 11:20:11,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:20:11,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:11,775 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 75 treesize of output 52 [2025-04-29 11:20:11,796 INFO L325 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2025-04-29 11:20:11,797 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 38 treesize of output 65 [2025-04-29 11:20:12,083 INFO L325 Elim1Store]: treesize reduction 68, result has 49.6 percent of original size [2025-04-29 11:20:12,083 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 94 [2025-04-29 11:20:12,271 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:20:12,272 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 192 treesize of output 140 [2025-04-29 11:20:12,321 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 5 treesize of output 3 [2025-04-29 11:20:12,426 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 181 treesize of output 122 [2025-04-29 11:20:12,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:12,563 INFO L325 Elim1Store]: treesize reduction 142, result has 51.9 percent of original size [2025-04-29 11:20:12,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 216 treesize of output 241 Killed by 15