./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/test-0214.i --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/memsafety/test-0214.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:44:15,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:44:15,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:44:15,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:44:15,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:44:15,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:44:15,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:44:15,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:44:15,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:44:15,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:44:15,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:44:15,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:44:15,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:44:15,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:44:15,646 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:44:15,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:44:15,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:44:15,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:44:15,647 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:44:15,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:44:15,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:15,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:15,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:15,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:15,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:44:15,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:44:15,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:44:15,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:44:15,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:15,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:44:15,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:44:15,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:44:15,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:44:15,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:44:15,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:44:15,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:44:15,649 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 -> 3f6f146d76d903376288fe056dbbc9e1a8443f92d5e8b82343734efc8a9842e4 [2025-04-30 10:44:15,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:44:15,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:44:15,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:44:15,887 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:44:15,887 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:44:15,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0214.i [2025-04-30 10:44:17,195 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3529b1f22/b45d9eae3c7c4b3295f15f3567901055/FLAG56e475425 [2025-04-30 10:44:17,417 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:44:17,418 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/test-0214.i [2025-04-30 10:44:17,426 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3529b1f22/b45d9eae3c7c4b3295f15f3567901055/FLAG56e475425 [2025-04-30 10:44:18,246 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3529b1f22/b45d9eae3c7c4b3295f15f3567901055 [2025-04-30 10:44:18,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:44:18,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:44:18,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:18,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:44:18,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:44:18,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a4afec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18, skipping insertion in model container [2025-04-30 10:44:18,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:44:18,546 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:18,553 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:44:18,599 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:44:18,629 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:44:18,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18 WrapperNode [2025-04-30 10:44:18,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:44:18,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:18,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:44:18,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:44:18,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,675 INFO L138 Inliner]: procedures = 181, calls = 42, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 170 [2025-04-30 10:44:18,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:44:18,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:44:18,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:44:18,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:44:18,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,706 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 7, 18]. 67 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 11 writes are split as follows [0, 5, 6]. [2025-04-30 10:44:18,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:44:18,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:44:18,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:44:18,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:44:18,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (1/1) ... [2025-04-30 10:44:18,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:44:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:18,753 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-30 10:44:18,755 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-30 10:44:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-04-30 10:44:18,770 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-04-30 10:44:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:44:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:44:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:44:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:44:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:44:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:44:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:44:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:44:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:44:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:44:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:44:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:44:18,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:44:18,867 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:44:18,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:44:19,140 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2025-04-30 10:44:19,140 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:44:19,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:44:19,149 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-30 10:44:19,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:19 BoogieIcfgContainer [2025-04-30 10:44:19,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:44:19,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:44:19,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:44:19,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:44:19,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:44:18" (1/3) ... [2025-04-30 10:44:19,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375278ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:19, skipping insertion in model container [2025-04-30 10:44:19,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:44:18" (2/3) ... [2025-04-30 10:44:19,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375278ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:44:19, skipping insertion in model container [2025-04-30 10:44:19,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:44:19" (3/3) ... [2025-04-30 10:44:19,156 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0214.i [2025-04-30 10:44:19,166 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:44:19,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0214.i that has 2 procedures, 141 locations, 162 edges, 1 initial locations, 5 loop locations, and 57 error locations. [2025-04-30 10:44:19,200 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:44:19,209 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;@44697c7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:44:19,209 INFO L341 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2025-04-30 10:44:19,213 INFO L278 IsEmpty]: Start isEmpty. Operand has 141 states, 80 states have (on average 1.95) internal successors, (156), 137 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:19,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:44:19,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:19,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:44:19,217 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:19,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:19,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1072917994, now seen corresponding path program 1 times [2025-04-30 10:44:19,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:19,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365379034] [2025-04-30 10:44:19,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:19,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:19,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:44:19,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:44:19,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:19,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:19,319 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-30 10:44:19,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:19,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365379034] [2025-04-30 10:44:19,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365379034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:19,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:19,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374492388] [2025-04-30 10:44:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-30 10:44:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:19,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-30 10:44:19,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:19,343 INFO L87 Difference]: Start difference. First operand has 141 states, 80 states have (on average 1.95) internal successors, (156), 137 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:19,365 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2025-04-30 10:44:19,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-30 10:44:19,367 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:44:19,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:19,371 INFO L225 Difference]: With dead ends: 141 [2025-04-30 10:44:19,372 INFO L226 Difference]: Without dead ends: 139 [2025-04-30 10:44:19,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-30 10:44:19,376 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:19,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-04-30 10:44:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-04-30 10:44:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 79 states have (on average 1.8987341772151898) internal successors, (150), 135 states have internal predecessors, (150), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2025-04-30 10:44:19,415 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 6 [2025-04-30 10:44:19,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:19,416 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2025-04-30 10:44:19,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:19,416 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2025-04-30 10:44:19,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:19,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:19,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:19,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:44:19,417 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:19,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1281276598, now seen corresponding path program 1 times [2025-04-30 10:44:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:19,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145878942] [2025-04-30 10:44:19,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:19,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:19,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:19,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:19,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:19,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:19,512 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-30 10:44:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:19,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145878942] [2025-04-30 10:44:19,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145878942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:19,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:19,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:44:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217799437] [2025-04-30 10:44:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:19,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:19,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:19,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:19,513 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:19,679 INFO L93 Difference]: Finished difference Result 269 states and 298 transitions. [2025-04-30 10:44:19,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:19,680 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:44:19,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:19,683 INFO L225 Difference]: With dead ends: 269 [2025-04-30 10:44:19,683 INFO L226 Difference]: Without dead ends: 269 [2025-04-30 10:44:19,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-30 10:44:19,684 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 135 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:19,684 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 193 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-04-30 10:44:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 188. [2025-04-30 10:44:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 125 states have (on average 1.864) internal successors, (233), 181 states have internal predecessors, (233), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-30 10:44:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 241 transitions. [2025-04-30 10:44:19,695 INFO L79 Accepts]: Start accepts. Automaton has 188 states and 241 transitions. Word has length 7 [2025-04-30 10:44:19,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:19,696 INFO L485 AbstractCegarLoop]: Abstraction has 188 states and 241 transitions. [2025-04-30 10:44:19,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:19,696 INFO L278 IsEmpty]: Start isEmpty. Operand 188 states and 241 transitions. [2025-04-30 10:44:19,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:19,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:19,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:19,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:44:19,696 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:19,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1281276597, now seen corresponding path program 1 times [2025-04-30 10:44:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:19,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807370244] [2025-04-30 10:44:19,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:19,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:19,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:19,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:19,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:19,839 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-30 10:44:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:19,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807370244] [2025-04-30 10:44:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807370244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450724892] [2025-04-30 10:44:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:19,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:19,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:19,841 INFO L87 Difference]: Start difference. First operand 188 states and 241 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:19,966 INFO L93 Difference]: Finished difference Result 317 states and 395 transitions. [2025-04-30 10:44:19,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:19,967 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:44:19,967 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:19,968 INFO L225 Difference]: With dead ends: 317 [2025-04-30 10:44:19,968 INFO L226 Difference]: Without dead ends: 317 [2025-04-30 10:44:19,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:19,969 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 105 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:19,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 325 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-04-30 10:44:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 261. [2025-04-30 10:44:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 192 states have (on average 1.8229166666666667) internal successors, (350), 250 states have internal predecessors, (350), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 366 transitions. [2025-04-30 10:44:19,989 INFO L79 Accepts]: Start accepts. Automaton has 261 states and 366 transitions. Word has length 7 [2025-04-30 10:44:19,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:19,989 INFO L485 AbstractCegarLoop]: Abstraction has 261 states and 366 transitions. [2025-04-30 10:44:19,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:19,989 INFO L278 IsEmpty]: Start isEmpty. Operand 261 states and 366 transitions. [2025-04-30 10:44:19,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:44:19,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:19,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:19,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:44:19,989 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:19,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:19,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1281276535, now seen corresponding path program 1 times [2025-04-30 10:44:19,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:19,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306028127] [2025-04-30 10:44:19,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:19,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:44:20,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:44:20,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,088 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-30 10:44:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:20,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306028127] [2025-04-30 10:44:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306028127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:20,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:20,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:20,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629901014] [2025-04-30 10:44:20,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:20,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:20,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:20,090 INFO L87 Difference]: Start difference. First operand 261 states and 366 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:20,193 INFO L93 Difference]: Finished difference Result 316 states and 393 transitions. [2025-04-30 10:44:20,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:20,193 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:44:20,193 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:20,194 INFO L225 Difference]: With dead ends: 316 [2025-04-30 10:44:20,194 INFO L226 Difference]: Without dead ends: 316 [2025-04-30 10:44:20,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:20,195 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 103 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:20,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 300 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-04-30 10:44:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 261. [2025-04-30 10:44:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 192 states have (on average 1.8229166666666667) internal successors, (350), 250 states have internal predecessors, (350), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 366 transitions. [2025-04-30 10:44:20,215 INFO L79 Accepts]: Start accepts. Automaton has 261 states and 366 transitions. Word has length 7 [2025-04-30 10:44:20,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:20,215 INFO L485 AbstractCegarLoop]: Abstraction has 261 states and 366 transitions. [2025-04-30 10:44:20,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,215 INFO L278 IsEmpty]: Start isEmpty. Operand 261 states and 366 transitions. [2025-04-30 10:44:20,215 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:20,215 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:20,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:20,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:44:20,216 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:20,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1136587248, now seen corresponding path program 1 times [2025-04-30 10:44:20,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:20,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320565609] [2025-04-30 10:44:20,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:20,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:20,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:20,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,242 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-30 10:44:20,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:20,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320565609] [2025-04-30 10:44:20,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320565609] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:20,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:20,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:20,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215321407] [2025-04-30 10:44:20,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:20,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:20,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:20,244 INFO L87 Difference]: Start difference. First operand 261 states and 366 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:20,333 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2025-04-30 10:44:20,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:20,334 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:20,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:20,336 INFO L225 Difference]: With dead ends: 325 [2025-04-30 10:44:20,337 INFO L226 Difference]: Without dead ends: 324 [2025-04-30 10:44:20,337 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-30 10:44:20,339 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:20,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 217 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-30 10:44:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 263. [2025-04-30 10:44:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 194 states have (on average 1.8144329896907216) internal successors, (352), 252 states have internal predecessors, (352), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-30 10:44:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 368 transitions. [2025-04-30 10:44:20,368 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 368 transitions. Word has length 10 [2025-04-30 10:44:20,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:20,368 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 368 transitions. [2025-04-30 10:44:20,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,368 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2025-04-30 10:44:20,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:20,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:20,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:20,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:44:20,368 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:20,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1136587632, now seen corresponding path program 1 times [2025-04-30 10:44:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:20,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079528000] [2025-04-30 10:44:20,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:20,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:20,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:20,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:20,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:20,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079528000] [2025-04-30 10:44:20,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079528000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:20,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:20,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:20,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903075768] [2025-04-30 10:44:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:20,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:20,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:20,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:20,492 INFO L87 Difference]: Start difference. First operand 263 states and 368 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:20,608 INFO L93 Difference]: Finished difference Result 402 states and 534 transitions. [2025-04-30 10:44:20,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:20,610 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:20,610 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:20,611 INFO L225 Difference]: With dead ends: 402 [2025-04-30 10:44:20,611 INFO L226 Difference]: Without dead ends: 399 [2025-04-30 10:44:20,611 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:20,612 INFO L437 NwaCegarLoop]: 139 mSDtfsCounter, 125 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:20,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 643 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-04-30 10:44:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 304. [2025-04-30 10:44:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.7974137931034482) internal successors, (417), 291 states have internal predecessors, (417), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 437 transitions. [2025-04-30 10:44:20,622 INFO L79 Accepts]: Start accepts. Automaton has 304 states and 437 transitions. Word has length 10 [2025-04-30 10:44:20,622 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:20,622 INFO L485 AbstractCegarLoop]: Abstraction has 304 states and 437 transitions. [2025-04-30 10:44:20,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,623 INFO L278 IsEmpty]: Start isEmpty. Operand 304 states and 437 transitions. [2025-04-30 10:44:20,623 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:44:20,623 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:20,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:20,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:44:20,623 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:20,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1134740590, now seen corresponding path program 1 times [2025-04-30 10:44:20,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:20,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130026273] [2025-04-30 10:44:20,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:20,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:44:20,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:44:20,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,699 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-30 10:44:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:20,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130026273] [2025-04-30 10:44:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130026273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130587692] [2025-04-30 10:44:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:20,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:20,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:20,700 INFO L87 Difference]: Start difference. First operand 304 states and 437 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:20,807 INFO L93 Difference]: Finished difference Result 389 states and 519 transitions. [2025-04-30 10:44:20,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:20,807 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:44:20,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:20,808 INFO L225 Difference]: With dead ends: 389 [2025-04-30 10:44:20,808 INFO L226 Difference]: Without dead ends: 384 [2025-04-30 10:44:20,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:20,809 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 113 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:20,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 672 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-04-30 10:44:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2025-04-30 10:44:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 227 states have (on average 1.8105726872246697) internal successors, (411), 286 states have internal predecessors, (411), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 431 transitions. [2025-04-30 10:44:20,815 INFO L79 Accepts]: Start accepts. Automaton has 299 states and 431 transitions. Word has length 10 [2025-04-30 10:44:20,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:20,815 INFO L485 AbstractCegarLoop]: Abstraction has 299 states and 431 transitions. [2025-04-30 10:44:20,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:44:20,815 INFO L278 IsEmpty]: Start isEmpty. Operand 299 states and 431 transitions. [2025-04-30 10:44:20,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:44:20,817 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:20,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:20,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:44:20,817 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:20,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1398073583, now seen corresponding path program 1 times [2025-04-30 10:44:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:20,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153918715] [2025-04-30 10:44:20,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:20,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:44:20,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:44:20,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:20,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:20,940 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-30 10:44:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:20,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153918715] [2025-04-30 10:44:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153918715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:20,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:20,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:20,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122097591] [2025-04-30 10:44:20,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:20,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:20,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:20,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:20,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:20,943 INFO L87 Difference]: Start difference. First operand 299 states and 431 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:21,133 INFO L93 Difference]: Finished difference Result 367 states and 478 transitions. [2025-04-30 10:44:21,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:21,133 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-04-30 10:44:21,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:21,134 INFO L225 Difference]: With dead ends: 367 [2025-04-30 10:44:21,135 INFO L226 Difference]: Without dead ends: 367 [2025-04-30 10:44:21,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:21,135 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 107 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:21,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 613 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-30 10:44:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 309. [2025-04-30 10:44:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 234 states have (on average 1.794871794871795) internal successors, (420), 294 states have internal predecessors, (420), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2025-04-30 10:44:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 446 transitions. [2025-04-30 10:44:21,147 INFO L79 Accepts]: Start accepts. Automaton has 309 states and 446 transitions. Word has length 13 [2025-04-30 10:44:21,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:21,147 INFO L485 AbstractCegarLoop]: Abstraction has 309 states and 446 transitions. [2025-04-30 10:44:21,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,147 INFO L278 IsEmpty]: Start isEmpty. Operand 309 states and 446 transitions. [2025-04-30 10:44:21,147 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:44:21,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:21,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:21,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:44:21,148 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:21,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1398073584, now seen corresponding path program 1 times [2025-04-30 10:44:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:21,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473800313] [2025-04-30 10:44:21,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:21,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:44:21,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:44:21,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,186 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-30 10:44:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:21,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473800313] [2025-04-30 10:44:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473800313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:21,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:21,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696184832] [2025-04-30 10:44:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:21,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:21,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:21,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:21,188 INFO L87 Difference]: Start difference. First operand 309 states and 446 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:21,322 INFO L93 Difference]: Finished difference Result 404 states and 540 transitions. [2025-04-30 10:44:21,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:21,323 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-04-30 10:44:21,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:21,324 INFO L225 Difference]: With dead ends: 404 [2025-04-30 10:44:21,325 INFO L226 Difference]: Without dead ends: 404 [2025-04-30 10:44:21,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 10:44:21,326 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 162 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:21,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 276 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-04-30 10:44:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 309. [2025-04-30 10:44:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 234 states have (on average 1.764957264957265) internal successors, (413), 294 states have internal predecessors, (413), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2025-04-30 10:44:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 439 transitions. [2025-04-30 10:44:21,337 INFO L79 Accepts]: Start accepts. Automaton has 309 states and 439 transitions. Word has length 13 [2025-04-30 10:44:21,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:21,338 INFO L485 AbstractCegarLoop]: Abstraction has 309 states and 439 transitions. [2025-04-30 10:44:21,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,338 INFO L278 IsEmpty]: Start isEmpty. Operand 309 states and 439 transitions. [2025-04-30 10:44:21,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:44:21,338 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:21,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:21,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:44:21,338 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:21,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1397150062, now seen corresponding path program 1 times [2025-04-30 10:44:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:21,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708190376] [2025-04-30 10:44:21,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:21,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:44:21,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:44:21,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,416 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-30 10:44:21,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:21,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708190376] [2025-04-30 10:44:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708190376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:21,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:21,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411001868] [2025-04-30 10:44:21,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:21,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:21,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:21,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:21,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:21,418 INFO L87 Difference]: Start difference. First operand 309 states and 439 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:21,583 INFO L93 Difference]: Finished difference Result 366 states and 468 transitions. [2025-04-30 10:44:21,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:21,584 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-04-30 10:44:21,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:21,585 INFO L225 Difference]: With dead ends: 366 [2025-04-30 10:44:21,585 INFO L226 Difference]: Without dead ends: 366 [2025-04-30 10:44:21,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:21,586 INFO L437 NwaCegarLoop]: 148 mSDtfsCounter, 102 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:21,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 628 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-30 10:44:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 303. [2025-04-30 10:44:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 231 states have (on average 1.774891774891775) internal successors, (410), 288 states have internal predecessors, (410), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 430 transitions. [2025-04-30 10:44:21,596 INFO L79 Accepts]: Start accepts. Automaton has 303 states and 430 transitions. Word has length 13 [2025-04-30 10:44:21,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:21,597 INFO L485 AbstractCegarLoop]: Abstraction has 303 states and 430 transitions. [2025-04-30 10:44:21,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,597 INFO L278 IsEmpty]: Start isEmpty. Operand 303 states and 430 transitions. [2025-04-30 10:44:21,597 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:44:21,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:21,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:21,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:44:21,597 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:21,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2032552335, now seen corresponding path program 1 times [2025-04-30 10:44:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:21,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366402269] [2025-04-30 10:44:21,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:21,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:44:21,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:44:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,656 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-30 10:44:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:21,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366402269] [2025-04-30 10:44:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366402269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954517061] [2025-04-30 10:44:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:21,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:21,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:21,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:21,657 INFO L87 Difference]: Start difference. First operand 303 states and 430 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:21,792 INFO L93 Difference]: Finished difference Result 394 states and 524 transitions. [2025-04-30 10:44:21,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:21,793 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-04-30 10:44:21,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:21,794 INFO L225 Difference]: With dead ends: 394 [2025-04-30 10:44:21,794 INFO L226 Difference]: Without dead ends: 394 [2025-04-30 10:44:21,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 10:44:21,795 INFO L437 NwaCegarLoop]: 104 mSDtfsCounter, 133 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:21,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 283 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-04-30 10:44:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 309. [2025-04-30 10:44:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 237 states have (on average 1.7552742616033756) internal successors, (416), 294 states have internal predecessors, (416), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 436 transitions. [2025-04-30 10:44:21,801 INFO L79 Accepts]: Start accepts. Automaton has 309 states and 436 transitions. Word has length 15 [2025-04-30 10:44:21,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:21,801 INFO L485 AbstractCegarLoop]: Abstraction has 309 states and 436 transitions. [2025-04-30 10:44:21,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,802 INFO L278 IsEmpty]: Start isEmpty. Operand 309 states and 436 transitions. [2025-04-30 10:44:21,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:44:21,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:21,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:21,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:44:21,802 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:21,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2032552336, now seen corresponding path program 1 times [2025-04-30 10:44:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:21,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359533826] [2025-04-30 10:44:21,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:21,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:44:21,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:44:21,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:21,851 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-30 10:44:21,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:21,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359533826] [2025-04-30 10:44:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359533826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:21,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:21,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:21,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778308518] [2025-04-30 10:44:21,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:21,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:21,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:21,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:21,852 INFO L87 Difference]: Start difference. First operand 309 states and 436 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:21,966 INFO L93 Difference]: Finished difference Result 357 states and 447 transitions. [2025-04-30 10:44:21,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:21,967 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-04-30 10:44:21,967 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:21,968 INFO L225 Difference]: With dead ends: 357 [2025-04-30 10:44:21,968 INFO L226 Difference]: Without dead ends: 357 [2025-04-30 10:44:21,968 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 10:44:21,968 INFO L437 NwaCegarLoop]: 144 mSDtfsCounter, 104 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:21,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 356 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-04-30 10:44:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 309. [2025-04-30 10:44:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 237 states have (on average 1.7172995780590716) internal successors, (407), 294 states have internal predecessors, (407), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 427 transitions. [2025-04-30 10:44:21,974 INFO L79 Accepts]: Start accepts. Automaton has 309 states and 427 transitions. Word has length 15 [2025-04-30 10:44:21,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:21,974 INFO L485 AbstractCegarLoop]: Abstraction has 309 states and 427 transitions. [2025-04-30 10:44:21,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:44:21,975 INFO L278 IsEmpty]: Start isEmpty. Operand 309 states and 427 transitions. [2025-04-30 10:44:21,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:44:21,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:21,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:21,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:44:21,975 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:21,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:21,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1135972409, now seen corresponding path program 1 times [2025-04-30 10:44:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:21,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338176680] [2025-04-30 10:44:21,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:21,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:21,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:44:21,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:44:21,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:21,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,000 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-30 10:44:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338176680] [2025-04-30 10:44:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338176680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:44:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243619911] [2025-04-30 10:44:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:22,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:22,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:22,002 INFO L87 Difference]: Start difference. First operand 309 states and 427 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-30 10:44:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,056 INFO L93 Difference]: Finished difference Result 306 states and 421 transitions. [2025-04-30 10:44:22,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:22,056 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2025-04-30 10:44:22,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,057 INFO L225 Difference]: With dead ends: 306 [2025-04-30 10:44:22,057 INFO L226 Difference]: Without dead ends: 306 [2025-04-30 10:44:22,057 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-30 10:44:22,058 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 228 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-30 10:44:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-04-30 10:44:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 237 states have (on average 1.6919831223628692) internal successors, (401), 291 states have internal predecessors, (401), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 421 transitions. [2025-04-30 10:44:22,063 INFO L79 Accepts]: Start accepts. Automaton has 306 states and 421 transitions. Word has length 19 [2025-04-30 10:44:22,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,063 INFO L485 AbstractCegarLoop]: Abstraction has 306 states and 421 transitions. [2025-04-30 10:44:22,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-30 10:44:22,064 INFO L278 IsEmpty]: Start isEmpty. Operand 306 states and 421 transitions. [2025-04-30 10:44:22,064 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:44:22,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:44:22,064 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:22,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1135972410, now seen corresponding path program 1 times [2025-04-30 10:44:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386145795] [2025-04-30 10:44:22,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:44:22,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:44:22,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,130 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-30 10:44:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386145795] [2025-04-30 10:44:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386145795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362859691] [2025-04-30 10:44:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:22,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:22,131 INFO L87 Difference]: Start difference. First operand 306 states and 421 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-30 10:44:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,188 INFO L93 Difference]: Finished difference Result 309 states and 423 transitions. [2025-04-30 10:44:22,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:22,188 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2025-04-30 10:44:22,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,189 INFO L225 Difference]: With dead ends: 309 [2025-04-30 10:44:22,189 INFO L226 Difference]: Without dead ends: 309 [2025-04-30 10:44:22,189 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:22,190 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-04-30 10:44:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-04-30 10:44:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 241 states have (on average 1.6721991701244814) internal successors, (403), 294 states have internal predecessors, (403), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 423 transitions. [2025-04-30 10:44:22,199 INFO L79 Accepts]: Start accepts. Automaton has 309 states and 423 transitions. Word has length 19 [2025-04-30 10:44:22,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,199 INFO L485 AbstractCegarLoop]: Abstraction has 309 states and 423 transitions. [2025-04-30 10:44:22,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-30 10:44:22,199 INFO L278 IsEmpty]: Start isEmpty. Operand 309 states and 423 transitions. [2025-04-30 10:44:22,200 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:44:22,200 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:44:22,200 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:22,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,201 INFO L85 PathProgramCache]: Analyzing trace with hash 855406338, now seen corresponding path program 1 times [2025-04-30 10:44:22,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550287237] [2025-04-30 10:44:22,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:44:22,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:44:22,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,268 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-30 10:44:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550287237] [2025-04-30 10:44:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550287237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:22,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979051010] [2025-04-30 10:44:22,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:22,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:22,269 INFO L87 Difference]: Start difference. First operand 309 states and 423 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-30 10:44:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,298 INFO L93 Difference]: Finished difference Result 315 states and 429 transitions. [2025-04-30 10:44:22,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:22,298 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2025-04-30 10:44:22,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,299 INFO L225 Difference]: With dead ends: 315 [2025-04-30 10:44:22,299 INFO L226 Difference]: Without dead ends: 315 [2025-04-30 10:44:22,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-30 10:44:22,300 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 11 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 417 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-04-30 10:44:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2025-04-30 10:44:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 243 states have (on average 1.6666666666666667) internal successors, (405), 296 states have internal predecessors, (405), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-04-30 10:44:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 425 transitions. [2025-04-30 10:44:22,305 INFO L79 Accepts]: Start accepts. Automaton has 311 states and 425 transitions. Word has length 20 [2025-04-30 10:44:22,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,306 INFO L485 AbstractCegarLoop]: Abstraction has 311 states and 425 transitions. [2025-04-30 10:44:22,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-30 10:44:22,306 INFO L278 IsEmpty]: Start isEmpty. Operand 311 states and 425 transitions. [2025-04-30 10:44:22,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:44:22,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:44:22,306 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:22,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,306 INFO L85 PathProgramCache]: Analyzing trace with hash 855462042, now seen corresponding path program 1 times [2025-04-30 10:44:22,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706112535] [2025-04-30 10:44:22,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:44:22,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:44:22,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,360 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-30 10:44:22,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706112535] [2025-04-30 10:44:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706112535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:22,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522272152] [2025-04-30 10:44:22,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:22,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:22,362 INFO L87 Difference]: Start difference. First operand 311 states and 425 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-30 10:44:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,405 INFO L93 Difference]: Finished difference Result 361 states and 489 transitions. [2025-04-30 10:44:22,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:22,405 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 20 [2025-04-30 10:44:22,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,406 INFO L225 Difference]: With dead ends: 361 [2025-04-30 10:44:22,406 INFO L226 Difference]: Without dead ends: 361 [2025-04-30 10:44:22,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:22,407 INFO L437 NwaCegarLoop]: 142 mSDtfsCounter, 31 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 844 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-30 10:44:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 337. [2025-04-30 10:44:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 264 states have (on average 1.628787878787879) internal successors, (430), 318 states have internal predecessors, (430), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 460 transitions. [2025-04-30 10:44:22,413 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 460 transitions. Word has length 20 [2025-04-30 10:44:22,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,413 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 460 transitions. [2025-04-30 10:44:22,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-30 10:44:22,413 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 460 transitions. [2025-04-30 10:44:22,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:44:22,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:44:22,414 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:22,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash 984544761, now seen corresponding path program 1 times [2025-04-30 10:44:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742240173] [2025-04-30 10:44:22,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:44:22,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:44:22,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,461 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-30 10:44:22,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742240173] [2025-04-30 10:44:22,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742240173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954135048] [2025-04-30 10:44:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:22,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:22,463 INFO L87 Difference]: Start difference. First operand 337 states and 460 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-30 10:44:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,515 INFO L93 Difference]: Finished difference Result 341 states and 464 transitions. [2025-04-30 10:44:22,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:22,515 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 20 [2025-04-30 10:44:22,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,516 INFO L225 Difference]: With dead ends: 341 [2025-04-30 10:44:22,516 INFO L226 Difference]: Without dead ends: 341 [2025-04-30 10:44:22,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:22,517 INFO L437 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-04-30 10:44:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-04-30 10:44:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 268 states have (on average 1.6194029850746268) internal successors, (434), 322 states have internal predecessors, (434), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 464 transitions. [2025-04-30 10:44:22,523 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 464 transitions. Word has length 20 [2025-04-30 10:44:22,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,523 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 464 transitions. [2025-04-30 10:44:22,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-30 10:44:22,523 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 464 transitions. [2025-04-30 10:44:22,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:44:22,524 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:44:22,524 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:22,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 984546683, now seen corresponding path program 1 times [2025-04-30 10:44:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324926045] [2025-04-30 10:44:22,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:44:22,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:44:22,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,580 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-30 10:44:22,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324926045] [2025-04-30 10:44:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324926045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083900053] [2025-04-30 10:44:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:22,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:22,582 INFO L87 Difference]: Start difference. First operand 341 states and 464 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-30 10:44:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,626 INFO L93 Difference]: Finished difference Result 374 states and 503 transitions. [2025-04-30 10:44:22,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:22,626 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 20 [2025-04-30 10:44:22,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,628 INFO L225 Difference]: With dead ends: 374 [2025-04-30 10:44:22,628 INFO L226 Difference]: Without dead ends: 374 [2025-04-30 10:44:22,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:22,628 INFO L437 NwaCegarLoop]: 165 mSDtfsCounter, 45 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 946 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-04-30 10:44:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 336. [2025-04-30 10:44:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 264 states have (on average 1.6136363636363635) internal successors, (426), 317 states have internal predecessors, (426), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 456 transitions. [2025-04-30 10:44:22,634 INFO L79 Accepts]: Start accepts. Automaton has 336 states and 456 transitions. Word has length 20 [2025-04-30 10:44:22,634 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,634 INFO L485 AbstractCegarLoop]: Abstraction has 336 states and 456 transitions. [2025-04-30 10:44:22,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-30 10:44:22,635 INFO L278 IsEmpty]: Start isEmpty. Operand 336 states and 456 transitions. [2025-04-30 10:44:22,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:44:22,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:44:22,635 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:22,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash 456116515, now seen corresponding path program 1 times [2025-04-30 10:44:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972476626] [2025-04-30 10:44:22,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:44:22,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:44:22,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,701 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-30 10:44:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972476626] [2025-04-30 10:44:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972476626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662988083] [2025-04-30 10:44:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:44:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:44:22,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:22,703 INFO L87 Difference]: Start difference. First operand 336 states and 456 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-30 10:44:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:22,777 INFO L93 Difference]: Finished difference Result 339 states and 458 transitions. [2025-04-30 10:44:22,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:44:22,778 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 21 [2025-04-30 10:44:22,778 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:22,779 INFO L225 Difference]: With dead ends: 339 [2025-04-30 10:44:22,779 INFO L226 Difference]: Without dead ends: 339 [2025-04-30 10:44:22,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:44:22,780 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:22,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 337 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-04-30 10:44:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 329. [2025-04-30 10:44:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 258 states have (on average 1.62015503875969) internal successors, (418), 310 states have internal predecessors, (418), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 448 transitions. [2025-04-30 10:44:22,787 INFO L79 Accepts]: Start accepts. Automaton has 329 states and 448 transitions. Word has length 21 [2025-04-30 10:44:22,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:22,787 INFO L485 AbstractCegarLoop]: Abstraction has 329 states and 448 transitions. [2025-04-30 10:44:22,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-30 10:44:22,787 INFO L278 IsEmpty]: Start isEmpty. Operand 329 states and 448 transitions. [2025-04-30 10:44:22,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:44:22,788 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:22,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:22,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:44:22,788 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:22,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1458133107, now seen corresponding path program 1 times [2025-04-30 10:44:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:22,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134964393] [2025-04-30 10:44:22,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:22,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:44:22,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:44:22,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:22,963 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-30 10:44:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:22,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134964393] [2025-04-30 10:44:22,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134964393] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:22,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:22,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:22,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438183966] [2025-04-30 10:44:22,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:22,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:22,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:22,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:22,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:22,964 INFO L87 Difference]: Start difference. First operand 329 states and 448 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-30 10:44:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,197 INFO L93 Difference]: Finished difference Result 400 states and 507 transitions. [2025-04-30 10:44:23,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:23,197 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2025-04-30 10:44:23,198 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,199 INFO L225 Difference]: With dead ends: 400 [2025-04-30 10:44:23,199 INFO L226 Difference]: Without dead ends: 400 [2025-04-30 10:44:23,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:23,199 INFO L437 NwaCegarLoop]: 135 mSDtfsCounter, 99 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 879 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-04-30 10:44:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 323. [2025-04-30 10:44:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 252 states have (on average 1.6150793650793651) internal successors, (407), 304 states have internal predecessors, (407), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 437 transitions. [2025-04-30 10:44:23,208 INFO L79 Accepts]: Start accepts. Automaton has 323 states and 437 transitions. Word has length 21 [2025-04-30 10:44:23,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,208 INFO L485 AbstractCegarLoop]: Abstraction has 323 states and 437 transitions. [2025-04-30 10:44:23,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-30 10:44:23,208 INFO L278 IsEmpty]: Start isEmpty. Operand 323 states and 437 transitions. [2025-04-30 10:44:23,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:23,208 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,208 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:23,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:44:23,208 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:23,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1114217086, now seen corresponding path program 1 times [2025-04-30 10:44:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859001646] [2025-04-30 10:44:23,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:23,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,247 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-30 10:44:23,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859001646] [2025-04-30 10:44:23,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859001646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:44:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464031356] [2025-04-30 10:44:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:44:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:44:23,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:23,248 INFO L87 Difference]: Start difference. First operand 323 states and 437 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-30 10:44:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,336 INFO L93 Difference]: Finished difference Result 328 states and 436 transitions. [2025-04-30 10:44:23,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:23,338 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2025-04-30 10:44:23,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,339 INFO L225 Difference]: With dead ends: 328 [2025-04-30 10:44:23,339 INFO L226 Difference]: Without dead ends: 328 [2025-04-30 10:44:23,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:44:23,339 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 30 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 365 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-04-30 10:44:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2025-04-30 10:44:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 257 states have (on average 1.54863813229572) internal successors, (398), 303 states have internal predecessors, (398), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 428 transitions. [2025-04-30 10:44:23,345 INFO L79 Accepts]: Start accepts. Automaton has 322 states and 428 transitions. Word has length 23 [2025-04-30 10:44:23,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,345 INFO L485 AbstractCegarLoop]: Abstraction has 322 states and 428 transitions. [2025-04-30 10:44:23,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-30 10:44:23,345 INFO L278 IsEmpty]: Start isEmpty. Operand 322 states and 428 transitions. [2025-04-30 10:44:23,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:44:23,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,346 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:23,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:44:23,346 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:23,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1114217087, now seen corresponding path program 1 times [2025-04-30 10:44:23,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125734535] [2025-04-30 10:44:23,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:44:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:44:23,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,459 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-30 10:44:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125734535] [2025-04-30 10:44:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125734535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944626492] [2025-04-30 10:44:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:23,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:23,461 INFO L87 Difference]: Start difference. First operand 322 states and 428 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-30 10:44:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,583 INFO L93 Difference]: Finished difference Result 246 states and 297 transitions. [2025-04-30 10:44:23,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:23,583 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2025-04-30 10:44:23,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,584 INFO L225 Difference]: With dead ends: 246 [2025-04-30 10:44:23,585 INFO L226 Difference]: Without dead ends: 246 [2025-04-30 10:44:23,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:23,587 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 877 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-30 10:44:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 224. [2025-04-30 10:44:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 167 states have (on average 1.526946107784431) internal successors, (255), 211 states have internal predecessors, (255), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 273 transitions. [2025-04-30 10:44:23,592 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 273 transitions. Word has length 23 [2025-04-30 10:44:23,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,592 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 273 transitions. [2025-04-30 10:44:23,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-30 10:44:23,593 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 273 transitions. [2025-04-30 10:44:23,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:44:23,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,593 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:23,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:44:23,594 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:23,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash -503006779, now seen corresponding path program 1 times [2025-04-30 10:44:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952142252] [2025-04-30 10:44:23,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:44:23,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:44:23,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,773 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-30 10:44:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952142252] [2025-04-30 10:44:23,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952142252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:23,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710633010] [2025-04-30 10:44:23,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:23,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:23,774 INFO L87 Difference]: Start difference. First operand 224 states and 273 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-30 10:44:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:23,926 INFO L93 Difference]: Finished difference Result 255 states and 307 transitions. [2025-04-30 10:44:23,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:23,926 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 24 [2025-04-30 10:44:23,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:23,927 INFO L225 Difference]: With dead ends: 255 [2025-04-30 10:44:23,927 INFO L226 Difference]: Without dead ends: 255 [2025-04-30 10:44:23,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:23,927 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 72 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:23,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 851 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-04-30 10:44:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 234. [2025-04-30 10:44:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.497175141242938) internal successors, (265), 221 states have internal predecessors, (265), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 283 transitions. [2025-04-30 10:44:23,933 INFO L79 Accepts]: Start accepts. Automaton has 234 states and 283 transitions. Word has length 24 [2025-04-30 10:44:23,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:23,933 INFO L485 AbstractCegarLoop]: Abstraction has 234 states and 283 transitions. [2025-04-30 10:44:23,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-30 10:44:23,933 INFO L278 IsEmpty]: Start isEmpty. Operand 234 states and 283 transitions. [2025-04-30 10:44:23,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-30 10:44:23,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:23,934 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:23,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:44:23,934 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:23,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1013540956, now seen corresponding path program 1 times [2025-04-30 10:44:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:23,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848780721] [2025-04-30 10:44:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:23,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:44:23,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:44:23,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:23,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:23,992 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-30 10:44:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:23,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848780721] [2025-04-30 10:44:23,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848780721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:23,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172476123] [2025-04-30 10:44:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:23,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:23,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:23,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:23,994 INFO L87 Difference]: Start difference. First operand 234 states and 283 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-30 10:44:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,040 INFO L93 Difference]: Finished difference Result 258 states and 310 transitions. [2025-04-30 10:44:24,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:24,040 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 24 [2025-04-30 10:44:24,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,041 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:44:24,041 INFO L226 Difference]: Without dead ends: 258 [2025-04-30 10:44:24,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:44:24,042 INFO L437 NwaCegarLoop]: 154 mSDtfsCounter, 20 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 886 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-30 10:44:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 234. [2025-04-30 10:44:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 177 states have (on average 1.4858757062146892) internal successors, (263), 221 states have internal predecessors, (263), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2025-04-30 10:44:24,046 INFO L79 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 24 [2025-04-30 10:44:24,046 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,046 INFO L485 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2025-04-30 10:44:24,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-30 10:44:24,046 INFO L278 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2025-04-30 10:44:24,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:44:24,047 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,047 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:24,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:44:24,047 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:24,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,047 INFO L85 PathProgramCache]: Analyzing trace with hash -32500890, now seen corresponding path program 1 times [2025-04-30 10:44:24,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663500] [2025-04-30 10:44:24,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:44:24,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:44:24,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,242 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-30 10:44:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663500] [2025-04-30 10:44:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:44:24,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535898825] [2025-04-30 10:44:24,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:24,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:24,243 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-30 10:44:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,403 INFO L93 Difference]: Finished difference Result 252 states and 300 transitions. [2025-04-30 10:44:24,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:44:24,403 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 25 [2025-04-30 10:44:24,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,405 INFO L225 Difference]: With dead ends: 252 [2025-04-30 10:44:24,405 INFO L226 Difference]: Without dead ends: 252 [2025-04-30 10:44:24,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:24,406 INFO L437 NwaCegarLoop]: 146 mSDtfsCounter, 53 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 832 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-04-30 10:44:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2025-04-30 10:44:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 182 states have (on average 1.4725274725274726) internal successors, (268), 226 states have internal predecessors, (268), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-04-30 10:44:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 286 transitions. [2025-04-30 10:44:24,414 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 286 transitions. Word has length 25 [2025-04-30 10:44:24,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,414 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 286 transitions. [2025-04-30 10:44:24,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-30 10:44:24,415 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 286 transitions. [2025-04-30 10:44:24,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:44:24,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,415 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:24,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:44:24,415 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:24,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1941945960, now seen corresponding path program 1 times [2025-04-30 10:44:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407493709] [2025-04-30 10:44:24,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:44:24,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:44:24,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,598 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-30 10:44:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407493709] [2025-04-30 10:44:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407493709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350737595] [2025-04-30 10:44:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:24,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:24,601 INFO L87 Difference]: Start difference. First operand 239 states and 286 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-30 10:44:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:24,821 INFO L93 Difference]: Finished difference Result 429 states and 517 transitions. [2025-04-30 10:44:24,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:24,822 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 26 [2025-04-30 10:44:24,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:24,823 INFO L225 Difference]: With dead ends: 429 [2025-04-30 10:44:24,823 INFO L226 Difference]: Without dead ends: 429 [2025-04-30 10:44:24,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:24,824 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 165 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:24,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 535 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-04-30 10:44:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 366. [2025-04-30 10:44:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 301 states have (on average 1.504983388704319) internal successors, (453), 347 states have internal predecessors, (453), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 483 transitions. [2025-04-30 10:44:24,832 INFO L79 Accepts]: Start accepts. Automaton has 366 states and 483 transitions. Word has length 26 [2025-04-30 10:44:24,832 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:24,832 INFO L485 AbstractCegarLoop]: Abstraction has 366 states and 483 transitions. [2025-04-30 10:44:24,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-30 10:44:24,832 INFO L278 IsEmpty]: Start isEmpty. Operand 366 states and 483 transitions. [2025-04-30 10:44:24,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:24,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:24,833 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:24,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:44:24,833 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:24,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 70782634, now seen corresponding path program 1 times [2025-04-30 10:44:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:24,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625738656] [2025-04-30 10:44:24,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:24,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:24,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:24,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:24,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:24,918 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-30 10:44:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:24,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625738656] [2025-04-30 10:44:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625738656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:24,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:24,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405995887] [2025-04-30 10:44:24,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:24,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:24,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:24,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:24,920 INFO L87 Difference]: Start difference. First operand 366 states and 483 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-30 10:44:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,049 INFO L93 Difference]: Finished difference Result 395 states and 513 transitions. [2025-04-30 10:44:25,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:25,050 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 27 [2025-04-30 10:44:25,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,051 INFO L225 Difference]: With dead ends: 395 [2025-04-30 10:44:25,051 INFO L226 Difference]: Without dead ends: 395 [2025-04-30 10:44:25,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:25,052 INFO L437 NwaCegarLoop]: 123 mSDtfsCounter, 171 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 564 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-04-30 10:44:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 387. [2025-04-30 10:44:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 323 states have (on average 1.4829721362229102) internal successors, (479), 368 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 509 transitions. [2025-04-30 10:44:25,058 INFO L79 Accepts]: Start accepts. Automaton has 387 states and 509 transitions. Word has length 27 [2025-04-30 10:44:25,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,058 INFO L485 AbstractCegarLoop]: Abstraction has 387 states and 509 transitions. [2025-04-30 10:44:25,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-30 10:44:25,058 INFO L278 IsEmpty]: Start isEmpty. Operand 387 states and 509 transitions. [2025-04-30 10:44:25,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:44:25,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,058 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:25,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-30 10:44:25,058 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:25,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1168428087, now seen corresponding path program 1 times [2025-04-30 10:44:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937697407] [2025-04-30 10:44:25,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:44:25,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:44:25,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,268 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-30 10:44:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937697407] [2025-04-30 10:44:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937697407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:44:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540930670] [2025-04-30 10:44:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:25,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:25,270 INFO L87 Difference]: Start difference. First operand 387 states and 509 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-30 10:44:25,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,641 INFO L93 Difference]: Finished difference Result 572 states and 734 transitions. [2025-04-30 10:44:25,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:25,641 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 27 [2025-04-30 10:44:25,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,643 INFO L225 Difference]: With dead ends: 572 [2025-04-30 10:44:25,643 INFO L226 Difference]: Without dead ends: 572 [2025-04-30 10:44:25,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:25,644 INFO L437 NwaCegarLoop]: 202 mSDtfsCounter, 168 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1194 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-04-30 10:44:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 510. [2025-04-30 10:44:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 438 states have (on average 1.5022831050228311) internal successors, (658), 485 states have internal predecessors, (658), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2025-04-30 10:44:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 700 transitions. [2025-04-30 10:44:25,652 INFO L79 Accepts]: Start accepts. Automaton has 510 states and 700 transitions. Word has length 27 [2025-04-30 10:44:25,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,652 INFO L485 AbstractCegarLoop]: Abstraction has 510 states and 700 transitions. [2025-04-30 10:44:25,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-30 10:44:25,653 INFO L278 IsEmpty]: Start isEmpty. Operand 510 states and 700 transitions. [2025-04-30 10:44:25,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:44:25,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,653 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:25,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:44:25,653 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:25,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1861532311, now seen corresponding path program 1 times [2025-04-30 10:44:25,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218373626] [2025-04-30 10:44:25,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:44:25,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:44:25,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:25,723 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-30 10:44:25,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:25,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218373626] [2025-04-30 10:44:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218373626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504074411] [2025-04-30 10:44:25,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:25,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:25,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:25,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:25,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:25,725 INFO L87 Difference]: Start difference. First operand 510 states and 700 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, (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-30 10:44:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:25,848 INFO L93 Difference]: Finished difference Result 527 states and 713 transitions. [2025-04-30 10:44:25,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:44:25,849 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, (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 28 [2025-04-30 10:44:25,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:25,850 INFO L225 Difference]: With dead ends: 527 [2025-04-30 10:44:25,851 INFO L226 Difference]: Without dead ends: 527 [2025-04-30 10:44:25,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:25,851 INFO L437 NwaCegarLoop]: 157 mSDtfsCounter, 148 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:25,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 689 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-04-30 10:44:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 519. [2025-04-30 10:44:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 448 states have (on average 1.4888392857142858) internal successors, (667), 494 states have internal predecessors, (667), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2025-04-30 10:44:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 709 transitions. [2025-04-30 10:44:25,860 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 709 transitions. Word has length 28 [2025-04-30 10:44:25,860 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:25,860 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 709 transitions. [2025-04-30 10:44:25,860 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, (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-30 10:44:25,860 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 709 transitions. [2025-04-30 10:44:25,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-30 10:44:25,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:25,861 INFO L218 NwaCegarLoop]: trace histogram [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-30 10:44:25,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:44:25,861 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:25,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -697364564, now seen corresponding path program 1 times [2025-04-30 10:44:25,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:25,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106081823] [2025-04-30 10:44:25,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:25,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:25,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-30 10:44:25,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-30 10:44:25,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:25,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,005 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-30 10:44:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106081823] [2025-04-30 10:44:26,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106081823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:26,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:26,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:44:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526320135] [2025-04-30 10:44:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:44:26,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:44:26,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:26,006 INFO L87 Difference]: Start difference. First operand 519 states and 709 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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-30 10:44:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:26,136 INFO L93 Difference]: Finished difference Result 518 states and 689 transitions. [2025-04-30 10:44:26,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:26,136 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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 29 [2025-04-30 10:44:26,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:26,138 INFO L225 Difference]: With dead ends: 518 [2025-04-30 10:44:26,138 INFO L226 Difference]: Without dead ends: 518 [2025-04-30 10:44:26,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:44:26,139 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 182 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:26,139 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 239 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:26,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-04-30 10:44:26,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 480. [2025-04-30 10:44:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 416 states have (on average 1.4350961538461537) internal successors, (597), 455 states have internal predecessors, (597), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 17 states have call predecessors, (28), 14 states have call successors, (28) [2025-04-30 10:44:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 639 transitions. [2025-04-30 10:44:26,148 INFO L79 Accepts]: Start accepts. Automaton has 480 states and 639 transitions. Word has length 29 [2025-04-30 10:44:26,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:26,148 INFO L485 AbstractCegarLoop]: Abstraction has 480 states and 639 transitions. [2025-04-30 10:44:26,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 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-30 10:44:26,148 INFO L278 IsEmpty]: Start isEmpty. Operand 480 states and 639 transitions. [2025-04-30 10:44:26,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:44:26,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:26,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:26,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-30 10:44:26,149 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:26,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash -862305941, now seen corresponding path program 1 times [2025-04-30 10:44:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:26,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751382320] [2025-04-30 10:44:26,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:26,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:44:26,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:44:26,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:44:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:26,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751382320] [2025-04-30 10:44:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751382320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:26,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889204808] [2025-04-30 10:44:26,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:26,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:26,286 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-30 10:44:26,288 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-30 10:44:26,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:44:26,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:44:26,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:26,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:26,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:44:26,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:26,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:26,765 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:26,765 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 19 treesize of output 23 [2025-04-30 10:44:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:44:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889204808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:26,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2025-04-30 10:44:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040121283] [2025-04-30 10:44:26,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:26,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:44:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:26,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:44:26,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:44:26,919 INFO L87 Difference]: Start difference. First operand 480 states and 639 transitions. Second operand has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:44:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,215 INFO L93 Difference]: Finished difference Result 507 states and 663 transitions. [2025-04-30 10:44:27,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:44:27,216 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2025-04-30 10:44:27,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,217 INFO L225 Difference]: With dead ends: 507 [2025-04-30 10:44:27,217 INFO L226 Difference]: Without dead ends: 507 [2025-04-30 10:44:27,217 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2025-04-30 10:44:27,218 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 600 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,218 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 798 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-30 10:44:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 378. [2025-04-30 10:44:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 323 states have (on average 1.3931888544891642) internal successors, (450), 359 states have internal predecessors, (450), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 480 transitions. [2025-04-30 10:44:27,224 INFO L79 Accepts]: Start accepts. Automaton has 378 states and 480 transitions. Word has length 40 [2025-04-30 10:44:27,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:27,224 INFO L485 AbstractCegarLoop]: Abstraction has 378 states and 480 transitions. [2025-04-30 10:44:27,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.681818181818182) internal successors, (103), 20 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-30 10:44:27,225 INFO L278 IsEmpty]: Start isEmpty. Operand 378 states and 480 transitions. [2025-04-30 10:44:27,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:44:27,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:27,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:27,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:27,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:27,427 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:27,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash -359235816, now seen corresponding path program 1 times [2025-04-30 10:44:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:27,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546925667] [2025-04-30 10:44:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:27,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:44:27,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:44:27,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:27,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:27,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546925667] [2025-04-30 10:44:27,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546925667] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:27,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164948313] [2025-04-30 10:44:27,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:27,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:27,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:27,597 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-30 10:44:27,599 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-30 10:44:27,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:44:27,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:44:27,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:27,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:27,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:44:27,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:27,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164948313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2025-04-30 10:44:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982255228] [2025-04-30 10:44:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:27,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:27,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:44:27,892 INFO L87 Difference]: Start difference. First operand 378 states and 480 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-30 10:44:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:27,991 INFO L93 Difference]: Finished difference Result 385 states and 487 transitions. [2025-04-30 10:44:27,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:27,991 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 40 [2025-04-30 10:44:27,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:27,992 INFO L225 Difference]: With dead ends: 385 [2025-04-30 10:44:27,992 INFO L226 Difference]: Without dead ends: 385 [2025-04-30 10:44:27,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:44:27,993 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 242 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:27,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 239 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-04-30 10:44:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 380. [2025-04-30 10:44:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 325 states have (on average 1.393846153846154) internal successors, (453), 361 states have internal predecessors, (453), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 483 transitions. [2025-04-30 10:44:28,005 INFO L79 Accepts]: Start accepts. Automaton has 380 states and 483 transitions. Word has length 40 [2025-04-30 10:44:28,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,005 INFO L485 AbstractCegarLoop]: Abstraction has 380 states and 483 transitions. [2025-04-30 10:44:28,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-30 10:44:28,005 INFO L278 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2025-04-30 10:44:28,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:44:28,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:28,012 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-30 10:44:28,206 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,SelfDestructingSolverStorable31 [2025-04-30 10:44:28,207 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:28,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash -359235754, now seen corresponding path program 1 times [2025-04-30 10:44:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369029231] [2025-04-30 10:44:28,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:44:28,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:44:28,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:28,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369029231] [2025-04-30 10:44:28,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369029231] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:28,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515495573] [2025-04-30 10:44:28,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:28,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:28,317 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-30 10:44:28,319 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-30 10:44:28,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-30 10:44:28,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-30 10:44:28,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:28,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:44:28,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:28,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:28,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515495573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:28,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:28,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2025-04-30 10:44:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054764333] [2025-04-30 10:44:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:28,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:28,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:28,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:28,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:28,608 INFO L87 Difference]: Start difference. First operand 380 states and 483 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-30 10:44:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:28,691 INFO L93 Difference]: Finished difference Result 384 states and 485 transitions. [2025-04-30 10:44:28,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:44:28,691 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 40 [2025-04-30 10:44:28,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:28,692 INFO L225 Difference]: With dead ends: 384 [2025-04-30 10:44:28,692 INFO L226 Difference]: Without dead ends: 384 [2025-04-30 10:44:28,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:28,693 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 236 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:28,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 239 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-04-30 10:44:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 377. [2025-04-30 10:44:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 323 states have (on average 1.3869969040247678) internal successors, (448), 358 states have internal predecessors, (448), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 478 transitions. [2025-04-30 10:44:28,701 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 478 transitions. Word has length 40 [2025-04-30 10:44:28,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:28,701 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 478 transitions. [2025-04-30 10:44:28,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-30 10:44:28,701 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 478 transitions. [2025-04-30 10:44:28,702 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-30 10:44:28,702 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:28,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:28,708 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-30 10:44:28,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:28,903 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:28,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1509180778, now seen corresponding path program 1 times [2025-04-30 10:44:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:28,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172475624] [2025-04-30 10:44:28,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:28,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:44:28,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:44:28,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:28,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:44:29,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172475624] [2025-04-30 10:44:29,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172475624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:44:29,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900702391] [2025-04-30 10:44:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:44:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:44:29,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:44:29,015 INFO L87 Difference]: Start difference. First operand 377 states and 478 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,111 INFO L93 Difference]: Finished difference Result 379 states and 474 transitions. [2025-04-30 10:44:29,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:44:29,112 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-04-30 10:44:29,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,113 INFO L225 Difference]: With dead ends: 379 [2025-04-30 10:44:29,114 INFO L226 Difference]: Without dead ends: 379 [2025-04-30 10:44:29,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:44:29,115 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 140 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 245 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-04-30 10:44:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 375. [2025-04-30 10:44:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 323 states have (on average 1.3622291021671826) internal successors, (440), 356 states have internal predecessors, (440), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 470 transitions. [2025-04-30 10:44:29,121 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 470 transitions. Word has length 42 [2025-04-30 10:44:29,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,121 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 470 transitions. [2025-04-30 10:44:29,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:29,121 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 470 transitions. [2025-04-30 10:44:29,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:44:29,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-30 10:44:29,122 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:29,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1064461603, now seen corresponding path program 1 times [2025-04-30 10:44:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549144538] [2025-04-30 10:44:29,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:44:29,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:44:29,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:29,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549144538] [2025-04-30 10:44:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549144538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:29,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-30 10:44:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733572885] [2025-04-30 10:44:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:29,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:44:29,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:29,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:44:29,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:44:29,683 INFO L87 Difference]: Start difference. First operand 375 states and 470 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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-30 10:44:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:29,956 INFO L93 Difference]: Finished difference Result 393 states and 490 transitions. [2025-04-30 10:44:29,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:44:29,956 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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 43 [2025-04-30 10:44:29,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:29,957 INFO L225 Difference]: With dead ends: 393 [2025-04-30 10:44:29,958 INFO L226 Difference]: Without dead ends: 393 [2025-04-30 10:44:29,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:44:29,958 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:29,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 542 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-30 10:44:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2025-04-30 10:44:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 337 states have (on average 1.3531157270029674) internal successors, (456), 370 states have internal predecessors, (456), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 486 transitions. [2025-04-30 10:44:29,965 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 486 transitions. Word has length 43 [2025-04-30 10:44:29,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:29,965 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 486 transitions. [2025-04-30 10:44:29,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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-30 10:44:29,966 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 486 transitions. [2025-04-30 10:44:29,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:44:29,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:29,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:29,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-30 10:44:29,968 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:29,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash -11911254, now seen corresponding path program 1 times [2025-04-30 10:44:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:29,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391420217] [2025-04-30 10:44:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:29,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:29,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:44:29,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:44:29,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:30,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391420217] [2025-04-30 10:44:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391420217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-04-30 10:44:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483975044] [2025-04-30 10:44:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:30,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:44:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:30,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:44:30,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:44:30,515 INFO L87 Difference]: Start difference. First operand 389 states and 486 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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-30 10:44:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:30,769 INFO L93 Difference]: Finished difference Result 393 states and 490 transitions. [2025-04-30 10:44:30,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:44:30,770 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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 44 [2025-04-30 10:44:30,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:30,771 INFO L225 Difference]: With dead ends: 393 [2025-04-30 10:44:30,771 INFO L226 Difference]: Without dead ends: 393 [2025-04-30 10:44:30,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:44:30,771 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 63 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:30,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 866 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-30 10:44:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2025-04-30 10:44:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 338 states have (on average 1.3520710059171597) internal successors, (457), 371 states have internal predecessors, (457), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-04-30 10:44:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 487 transitions. [2025-04-30 10:44:30,779 INFO L79 Accepts]: Start accepts. Automaton has 390 states and 487 transitions. Word has length 44 [2025-04-30 10:44:30,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:30,779 INFO L485 AbstractCegarLoop]: Abstraction has 390 states and 487 transitions. [2025-04-30 10:44:30,779 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 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-30 10:44:30,779 INFO L278 IsEmpty]: Start isEmpty. Operand 390 states and 487 transitions. [2025-04-30 10:44:30,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:44:30,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:30,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:30,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-30 10:44:30,781 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:30,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash 366523826, now seen corresponding path program 1 times [2025-04-30 10:44:30,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:30,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384272060] [2025-04-30 10:44:30,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:30,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:44:30,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:44:30,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:30,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:31,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384272060] [2025-04-30 10:44:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384272060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:31,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419147273] [2025-04-30 10:44:31,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:31,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:31,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:31,390 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-30 10:44:31,392 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-30 10:44:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:44:31,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:44:31,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:31,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:31,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:44:31,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:31,778 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-30 10:44:31,874 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 19 [2025-04-30 10:44:31,978 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 27 treesize of output 11 [2025-04-30 10:44:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:31,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:31,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419147273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:31,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:31,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 29 [2025-04-30 10:44:31,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174419586] [2025-04-30 10:44:31,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:31,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:44:31,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:31,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:44:31,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:44:31,983 INFO L87 Difference]: Start difference. First operand 390 states and 487 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 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-30 10:44:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:32,457 INFO L93 Difference]: Finished difference Result 602 states and 737 transitions. [2025-04-30 10:44:32,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:44:32,457 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 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 44 [2025-04-30 10:44:32,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:32,459 INFO L225 Difference]: With dead ends: 602 [2025-04-30 10:44:32,459 INFO L226 Difference]: Without dead ends: 602 [2025-04-30 10:44:32,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2025-04-30 10:44:32,459 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 361 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:32,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1443 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-04-30 10:44:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 478. [2025-04-30 10:44:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 418 states have (on average 1.368421052631579) internal successors, (572), 455 states have internal predecessors, (572), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 15 states have call predecessors, (28), 14 states have call successors, (28) [2025-04-30 10:44:32,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 614 transitions. [2025-04-30 10:44:32,466 INFO L79 Accepts]: Start accepts. Automaton has 478 states and 614 transitions. Word has length 44 [2025-04-30 10:44:32,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:32,467 INFO L485 AbstractCegarLoop]: Abstraction has 478 states and 614 transitions. [2025-04-30 10:44:32,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 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-30 10:44:32,467 INFO L278 IsEmpty]: Start isEmpty. Operand 478 states and 614 transitions. [2025-04-30 10:44:32,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-30 10:44:32,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:32,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:32,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:44:32,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-30 10:44:32,668 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2025-04-30 10:44:32,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash 366523442, now seen corresponding path program 1 times [2025-04-30 10:44:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:32,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886291435] [2025-04-30 10:44:32,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:32,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:44:32,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:44:32,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:32,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:33,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886291435] [2025-04-30 10:44:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886291435] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:33,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681346454] [2025-04-30 10:44:33,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:33,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:33,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:33,211 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-30 10:44:33,212 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-30 10:44:33,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:44:33,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:44:33,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:33,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:33,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-30 10:44:33,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:33,439 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-30 10:44:33,677 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-30 10:44:33,677 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 19 treesize of output 22 [2025-04-30 10:44:33,700 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-30 10:44:33,700 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 19 treesize of output 18 [2025-04-30 10:44:33,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:33,873 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-30 10:44:33,873 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 1 case distinctions, treesize of input 38 treesize of output 36 [2025-04-30 10:44:33,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:33,879 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-30 10:44:33,879 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 1 case distinctions, treesize of input 28 treesize of output 30 [2025-04-30 10:44:34,266 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:34,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 86 [2025-04-30 10:44:34,284 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:34,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 72 [2025-04-30 10:44:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:44:34,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:38,830 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse3 (* |c_ULTIMATE.start_append_one_~to#1| 4))) (and (forall ((|ULTIMATE.start_append_one_~list#1.offset| Int)) (let ((.cse1 (+ .cse3 |ULTIMATE.start_append_one_~list#1.offset|)) (.cse2 (+ |ULTIMATE.start_append_one_~list#1.offset| 4))) (or (< |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (store .cse0 .cse1 |c_ULTIMATE.start_append_one_~item~1#1.base|) .cse2 |c_ULTIMATE.start_append_one_~item~1#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|)) 1) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_append_one_~list#1.base|) .cse1 |c_ULTIMATE.start_append_one_~item~1#1.offset|) .cse2 |c_ULTIMATE.start_append_one_~item~1#1.offset|)) |c_~#list~0.base|) |c_~#list~0.offset|) 0)))) (forall ((|ULTIMATE.start_append_one_~list#1.offset| Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (store .cse0 (+ .cse3 |ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| 4) |c_ULTIMATE.start_append_one_~item~1#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|))) (or (< |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |c_#valid| .cse4) 1) (= .cse4 0)))))) is different from false [2025-04-30 10:44:42,866 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse2 (* |c_ULTIMATE.start_append_one_~to#1| 4))) (and (forall ((|ULTIMATE.start_append_one_~list#1.offset| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (store .cse1 (+ .cse2 |ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|) (+ |ULTIMATE.start_append_one_~list#1.offset| 4) |c_ULTIMATE.start_create_item_#res#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|))) (or (< |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse0 0)))) (forall ((|ULTIMATE.start_append_one_~list#1.offset| Int)) (let ((.cse3 (+ .cse2 |ULTIMATE.start_append_one_~list#1.offset|)) (.cse4 (+ |ULTIMATE.start_append_one_~list#1.offset| 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_append_one_~list#1.base|) .cse3 |c_ULTIMATE.start_create_item_#res#1.offset|) .cse4 |c_ULTIMATE.start_create_item_#res#1.offset|)) |c_~#list~0.base|) |c_~#list~0.offset|) 0) (< |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (store .cse1 .cse3 |c_ULTIMATE.start_create_item_#res#1.base|) .cse4 |c_ULTIMATE.start_create_item_#res#1.base|)) |c_~#list~0.base|) |c_~#list~0.offset|)) 1)))))) is different from false Killed by 15