./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/20020406-1.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/20020406-1.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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:43:44,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:43:44,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:43:44,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:43:44,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:43:44,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:43:44,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:43:44,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:43:44,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:43:44,344 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:43:44,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:43:44,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:43:44,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:43:44,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:43:44,344 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:43:44,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:43:44,345 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:43:44,346 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:44,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:44,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:43:44,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:43:44,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:43:44,347 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2025-04-30 10:43:44,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:43:44,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:43:44,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:43:44,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:43:44,565 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:43:44,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1.i [2025-04-30 10:43:45,902 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c2f2893/1433f486f1c549baa804ae0a25222aa7/FLAGef74f6781 [2025-04-30 10:43:46,179 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:43:46,180 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/20020406-1.i [2025-04-30 10:43:46,197 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c2f2893/1433f486f1c549baa804ae0a25222aa7/FLAGef74f6781 [2025-04-30 10:43:46,952 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c2f2893/1433f486f1c549baa804ae0a25222aa7 [2025-04-30 10:43:46,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:43:46,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:43:46,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:43:46,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:43:46,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:43:46,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:43:46" (1/1) ... [2025-04-30 10:43:46,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f576dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:46, skipping insertion in model container [2025-04-30 10:43:46,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:43:46" (1/1) ... [2025-04-30 10:43:46,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:43:47,316 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:43:47,347 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:43:47,354 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:43:47,427 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:43:47,467 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:43:47,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47 WrapperNode [2025-04-30 10:43:47,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:43:47,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:43:47,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:43:47,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:43:47,473 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:43:47" (1/1) ... [2025-04-30 10:43:47,486 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:43:47" (1/1) ... [2025-04-30 10:43:47,502 INFO L138 Inliner]: procedures = 283, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-04-30 10:43:47,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:43:47,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:43:47,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:43:47,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:43:47,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,535 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 9, 17, 2]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 16 writes are split as follows [0, 6, 8, 2]. [2025-04-30 10:43:47,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:43:47,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:43:47,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:43:47,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:43:47,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (1/1) ... [2025-04-30 10:43:47,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:43:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:47,580 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:43:47,583 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:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2025-04-30 10:43:47,598 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2025-04-30 10:43:47,598 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2025-04-30 10:43:47,598 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2025-04-30 10:43:47,598 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:43:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2025-04-30 10:43:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2025-04-30 10:43:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:43:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2025-04-30 10:43:47,600 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2025-04-30 10:43:47,600 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-30 10:43:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:43:47,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:43:47,730 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:43:47,732 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:43:48,111 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-04-30 10:43:48,112 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:43:48,119 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:43:48,119 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:43:48,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:43:48 BoogieIcfgContainer [2025-04-30 10:43:48,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:43:48,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:43:48,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:43:48,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:43:48,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:43:46" (1/3) ... [2025-04-30 10:43:48,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4640cd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:43:48, skipping insertion in model container [2025-04-30 10:43:48,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:43:47" (2/3) ... [2025-04-30 10:43:48,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4640cd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:43:48, skipping insertion in model container [2025-04-30 10:43:48,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:43:48" (3/3) ... [2025-04-30 10:43:48,129 INFO L128 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2025-04-30 10:43:48,142 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:43:48,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 20020406-1.i that has 9 procedures, 192 locations, 266 edges, 1 initial locations, 3 loop locations, and 55 error locations. [2025-04-30 10:43:48,177 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:43:48,186 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;@7956a70d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:43:48,186 INFO L341 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-04-30 10:43:48,190 INFO L278 IsEmpty]: Start isEmpty. Operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:48,194 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:43:48,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:48,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:43:48,196 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:48,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 232998552, now seen corresponding path program 1 times [2025-04-30 10:43:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:48,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170235215] [2025-04-30 10:43:48,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:48,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:43:48,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:43:48,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:48,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:48,379 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:43:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:48,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170235215] [2025-04-30 10:43:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170235215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871635784] [2025-04-30 10:43:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:48,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:48,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:48,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:48,404 INFO L87 Difference]: Start difference. First operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:48,516 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-04-30 10:43:48,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:48,517 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:43:48,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:48,522 INFO L225 Difference]: With dead ends: 187 [2025-04-30 10:43:48,522 INFO L226 Difference]: Without dead ends: 185 [2025-04-30 10:43:48,523 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:43:48,525 INFO L437 NwaCegarLoop]: 208 mSDtfsCounter, 15 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:48,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-30 10:43:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-04-30 10:43:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 92 states have (on average 1.641304347826087) internal successors, (151), 144 states have internal predecessors, (151), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2025-04-30 10:43:48,560 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 5 [2025-04-30 10:43:48,561 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:48,561 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2025-04-30 10:43:48,561 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:48,561 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2025-04-30 10:43:48,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:43:48,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:48,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:43:48,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:43:48,562 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:48,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash 232998553, now seen corresponding path program 1 times [2025-04-30 10:43:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:48,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600167120] [2025-04-30 10:43:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:48,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:43:48,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:43:48,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:48,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:48,672 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:43:48,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:48,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600167120] [2025-04-30 10:43:48,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600167120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:48,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:48,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:43:48,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840341359] [2025-04-30 10:43:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:48,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:43:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:48,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:43:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:43:48,676 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:48,785 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-04-30 10:43:48,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:48,786 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:43:48,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:48,788 INFO L225 Difference]: With dead ends: 187 [2025-04-30 10:43:48,789 INFO L226 Difference]: Without dead ends: 187 [2025-04-30 10:43:48,789 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:43:48,792 INFO L437 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:48,792 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 376 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-30 10:43:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2025-04-30 10:43:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 145 states have internal predecessors, (152), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2025-04-30 10:43:48,804 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 5 [2025-04-30 10:43:48,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:48,804 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2025-04-30 10:43:48,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:48,804 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2025-04-30 10:43:48,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:43:48,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:48,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:48,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:43:48,805 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:48,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 573308570, now seen corresponding path program 1 times [2025-04-30 10:43:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:48,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498767207] [2025-04-30 10:43:48,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:48,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:43:48,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:43:48,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:48,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:49,019 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:43:49,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:49,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498767207] [2025-04-30 10:43:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498767207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:49,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:49,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:43:49,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967683688] [2025-04-30 10:43:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:49,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:43:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:49,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:43:49,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:43:49,020 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:49,154 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-04-30 10:43:49,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:43:49,155 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:43:49,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:49,156 INFO L225 Difference]: With dead ends: 182 [2025-04-30 10:43:49,157 INFO L226 Difference]: Without dead ends: 182 [2025-04-30 10:43:49,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:43:49,158 INFO L437 NwaCegarLoop]: 205 mSDtfsCounter, 14 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:49,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 490 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-30 10:43:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-04-30 10:43:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-04-30 10:43:49,174 INFO L79 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 7 [2025-04-30 10:43:49,174 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:49,174 INFO L485 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-04-30 10:43:49,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:49,175 INFO L278 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-04-30 10:43:49,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:43:49,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:49,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:49,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:43:49,175 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:49,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash 409168730, now seen corresponding path program 1 times [2025-04-30 10:43:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:49,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589485626] [2025-04-30 10:43:49,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:49,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:43:49,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:43:49,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:49,296 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:43:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:49,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589485626] [2025-04-30 10:43:49,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589485626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:49,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:49,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:43:49,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681323246] [2025-04-30 10:43:49,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:49,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:43:49,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:49,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:43:49,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:43:49,298 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:49,476 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-04-30 10:43:49,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:43:49,476 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:43:49,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:49,477 INFO L225 Difference]: With dead ends: 182 [2025-04-30 10:43:49,477 INFO L226 Difference]: Without dead ends: 182 [2025-04-30 10:43:49,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:43:49,479 INFO L437 NwaCegarLoop]: 207 mSDtfsCounter, 12 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:49,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 826 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-30 10:43:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-04-30 10:43:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 92 states have (on average 1.576086956521739) internal successors, (145), 138 states have internal predecessors, (145), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 215 transitions. [2025-04-30 10:43:49,486 INFO L79 Accepts]: Start accepts. Automaton has 179 states and 215 transitions. Word has length 11 [2025-04-30 10:43:49,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:49,486 INFO L485 AbstractCegarLoop]: Abstraction has 179 states and 215 transitions. [2025-04-30 10:43:49,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:49,486 INFO L278 IsEmpty]: Start isEmpty. Operand 179 states and 215 transitions. [2025-04-30 10:43:49,486 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:43:49,486 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:49,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:49,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:43:49,487 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:49,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:49,487 INFO L85 PathProgramCache]: Analyzing trace with hash -200671202, now seen corresponding path program 1 times [2025-04-30 10:43:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:49,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877263069] [2025-04-30 10:43:49,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:49,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:43:49,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:43:49,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:49,733 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:43:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:49,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877263069] [2025-04-30 10:43:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877263069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:49,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:49,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:43:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951696524] [2025-04-30 10:43:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:49,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:43:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:49,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:43:49,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:43:49,736 INFO L87 Difference]: Start difference. First operand 179 states and 215 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:49,969 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-04-30 10:43:49,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:43:49,969 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-30 10:43:49,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:49,970 INFO L225 Difference]: With dead ends: 195 [2025-04-30 10:43:49,970 INFO L226 Difference]: Without dead ends: 195 [2025-04-30 10:43:49,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:43:49,971 INFO L437 NwaCegarLoop]: 204 mSDtfsCounter, 25 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:49,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1244 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:43:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-30 10:43:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-04-30 10:43:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 107 states have (on average 1.5046728971962617) internal successors, (161), 153 states have internal predecessors, (161), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2025-04-30 10:43:49,978 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 12 [2025-04-30 10:43:49,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:49,978 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2025-04-30 10:43:49,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:43:49,978 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2025-04-30 10:43:49,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:43:49,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:49,979 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:43:49,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:43:49,979 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:49,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash 54082167, now seen corresponding path program 1 times [2025-04-30 10:43:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:49,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572465416] [2025-04-30 10:43:49,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:49,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:43:50,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:43:50,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:50,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:50,066 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:43:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:50,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572465416] [2025-04-30 10:43:50,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572465416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:50,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:50,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:43:50,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137451092] [2025-04-30 10:43:50,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:50,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:43:50,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:50,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:43:50,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:43:50,068 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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:43:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:50,218 INFO L93 Difference]: Finished difference Result 193 states and 229 transitions. [2025-04-30 10:43:50,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:43:50,219 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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:43:50,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:50,220 INFO L225 Difference]: With dead ends: 193 [2025-04-30 10:43:50,220 INFO L226 Difference]: Without dead ends: 193 [2025-04-30 10:43:50,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:43:50,220 INFO L437 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:50,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 783 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-30 10:43:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-30 10:43:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 107 states have (on average 1.485981308411215) internal successors, (159), 151 states have internal predecessors, (159), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 229 transitions. [2025-04-30 10:43:50,231 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 229 transitions. Word has length 21 [2025-04-30 10:43:50,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:50,231 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 229 transitions. [2025-04-30 10:43:50,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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:43:50,231 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 229 transitions. [2025-04-30 10:43:50,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:43:50,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:50,232 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:43:50,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:43:50,232 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:50,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash 54082168, now seen corresponding path program 1 times [2025-04-30 10:43:50,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:50,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944732976] [2025-04-30 10:43:50,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:50,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-30 10:43:50,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:43:50,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:50,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:50,383 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:43:50,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:50,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944732976] [2025-04-30 10:43:50,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944732976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:50,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:50,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:43:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987345919] [2025-04-30 10:43:50,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:50,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:43:50,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:50,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:43:50,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:50,385 INFO L87 Difference]: Start difference. First operand 193 states and 229 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:43:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:50,533 INFO L93 Difference]: Finished difference Result 191 states and 227 transitions. [2025-04-30 10:43:50,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:43:50,534 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:43:50,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:50,535 INFO L225 Difference]: With dead ends: 191 [2025-04-30 10:43:50,537 INFO L226 Difference]: Without dead ends: 191 [2025-04-30 10:43:50,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:50,538 INFO L437 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:50,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 980 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-30 10:43:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-04-30 10:43:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 149 states have internal predecessors, (157), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2025-04-30 10:43:50,547 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 21 [2025-04-30 10:43:50,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:50,547 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2025-04-30 10:43:50,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:43:50,547 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2025-04-30 10:43:50,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:43:50,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:50,548 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] [2025-04-30 10:43:50,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:43:50,548 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:50,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1676547370, now seen corresponding path program 1 times [2025-04-30 10:43:50,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:50,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708863176] [2025-04-30 10:43:50,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:50,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:43:50,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:43:50,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:50,748 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:43:50,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:50,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708863176] [2025-04-30 10:43:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708863176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:43:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586806139] [2025-04-30 10:43:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:50,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:43:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:50,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:43:50,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:50,750 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:43:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:50,843 INFO L93 Difference]: Finished difference Result 217 states and 260 transitions. [2025-04-30 10:43:50,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:43:50,844 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2025-04-30 10:43:50,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:50,846 INFO L225 Difference]: With dead ends: 217 [2025-04-30 10:43:50,846 INFO L226 Difference]: Without dead ends: 211 [2025-04-30 10:43:50,846 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:43:50,846 INFO L437 NwaCegarLoop]: 206 mSDtfsCounter, 18 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:50,847 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-30 10:43:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-04-30 10:43:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.435483870967742) internal successors, (178), 166 states have internal predecessors, (178), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-04-30 10:43:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-04-30 10:43:50,852 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 22 [2025-04-30 10:43:50,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:50,853 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-04-30 10:43:50,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:43:50,853 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-04-30 10:43:50,853 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:43:50,853 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:50,853 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:43:50,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:43:50,853 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:50,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash -809998102, now seen corresponding path program 1 times [2025-04-30 10:43:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:50,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360834384] [2025-04-30 10:43:50,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:50,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:43:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:43:50,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:50,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:51,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360834384] [2025-04-30 10:43:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360834384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:51,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702645985] [2025-04-30 10:43:51,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:51,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:51,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:51,089 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:43:51,090 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:43:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:43:51,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:43:51,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:51,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:51,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:43:51,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:51,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:51,247 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:51,355 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 47 treesize of output 29 [2025-04-30 10:43:51,359 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 38 treesize of output 26 [2025-04-30 10:43:51,367 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 51 treesize of output 29 [2025-04-30 10:43:51,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-04-30 10:43:51,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-04-30 10:43:51,449 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-30 10:43:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:51,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:43:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702645985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:51,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:43:51,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-04-30 10:43:51,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488381626] [2025-04-30 10:43:51,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:51,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:43:51,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:51,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:43:51,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:43:51,471 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:43:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:51,811 INFO L93 Difference]: Finished difference Result 213 states and 260 transitions. [2025-04-30 10:43:51,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:43:51,811 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:43:51,811 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:51,812 INFO L225 Difference]: With dead ends: 213 [2025-04-30 10:43:51,812 INFO L226 Difference]: Without dead ends: 213 [2025-04-30 10:43:51,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:43:51,813 INFO L437 NwaCegarLoop]: 190 mSDtfsCounter, 23 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:51,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1276 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:43:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-04-30 10:43:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2025-04-30 10:43:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 165 states have internal predecessors, (177), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-04-30 10:43:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2025-04-30 10:43:51,819 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 23 [2025-04-30 10:43:51,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:51,819 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2025-04-30 10:43:51,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:43:51,820 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2025-04-30 10:43:51,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:43:51,820 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:51,820 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:43:51,827 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:43:52,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:52,021 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:52,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -809998103, now seen corresponding path program 1 times [2025-04-30 10:43:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:52,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982741307] [2025-04-30 10:43:52,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:52,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:43:52,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:43:52,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:52,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:52,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:52,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982741307] [2025-04-30 10:43:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982741307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:52,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313664814] [2025-04-30 10:43:52,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:52,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:52,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:52,229 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:43:52,230 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:43:52,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:43:52,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:43:52,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:52,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:52,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:43:52,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:52,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:52,362 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 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-30 10:43:52,367 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 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-30 10:43:52,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:43:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:43:52,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:43:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313664814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:43:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-04-30 10:43:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747735345] [2025-04-30 10:43:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:52,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:43:52,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:52,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:43:52,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:43:52,422 INFO L87 Difference]: Start difference. First operand 208 states and 251 transitions. Second operand has 9 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:43:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:52,647 INFO L93 Difference]: Finished difference Result 212 states and 259 transitions. [2025-04-30 10:43:52,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:43:52,648 INFO L79 Accepts]: Start accepts. Automaton has has 9 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:43:52,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:52,649 INFO L225 Difference]: With dead ends: 212 [2025-04-30 10:43:52,649 INFO L226 Difference]: Without dead ends: 212 [2025-04-30 10:43:52,649 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:43:52,650 INFO L437 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:52,650 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1295 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:43:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-04-30 10:43:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2025-04-30 10:43:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 164 states have internal predecessors, (176), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-04-30 10:43:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2025-04-30 10:43:52,656 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 23 [2025-04-30 10:43:52,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:52,656 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2025-04-30 10:43:52,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 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:43:52,657 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2025-04-30 10:43:52,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-30 10:43:52,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:52,657 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] [2025-04-30 10:43:52,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:52,858 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,SelfDestructingSolverStorable9 [2025-04-30 10:43:52,858 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:52,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:52,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1891975010, now seen corresponding path program 1 times [2025-04-30 10:43:52,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:52,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235270038] [2025-04-30 10:43:52,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:52,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:43:52,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:43:52,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:52,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:53,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235270038] [2025-04-30 10:43:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235270038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:53,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729150215] [2025-04-30 10:43:53,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:53,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:53,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:53,083 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:43:53,085 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:43:53,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:43:53,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:43:53,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:53,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:43:53,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:53,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:43:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:43:53,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729150215] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:43:53,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:43:53,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-30 10:43:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837224523] [2025-04-30 10:43:53,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:43:53,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:43:53,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:53,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:43:53,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:43:53,375 INFO L87 Difference]: Start difference. First operand 207 states and 250 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:53,651 INFO L93 Difference]: Finished difference Result 246 states and 303 transitions. [2025-04-30 10:43:53,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:43:53,654 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-04-30 10:43:53,654 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:53,655 INFO L225 Difference]: With dead ends: 246 [2025-04-30 10:43:53,655 INFO L226 Difference]: Without dead ends: 234 [2025-04-30 10:43:53,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=442, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:43:53,656 INFO L437 NwaCegarLoop]: 201 mSDtfsCounter, 77 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:53,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1715 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:43:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-30 10:43:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 211. [2025-04-30 10:43:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 128 states have (on average 1.4140625) internal successors, (181), 168 states have internal predecessors, (181), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-04-30 10:43:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 255 transitions. [2025-04-30 10:43:53,664 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 255 transitions. Word has length 35 [2025-04-30 10:43:53,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:53,665 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 255 transitions. [2025-04-30 10:43:53,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:53,665 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 255 transitions. [2025-04-30 10:43:53,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:43:53,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:53,665 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-04-30 10:43:53,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:43:53,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:53,870 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:53,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1786152030, now seen corresponding path program 2 times [2025-04-30 10:43:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:53,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16041944] [2025-04-30 10:43:53,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:43:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:53,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:43:53,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:43:53,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:43:53,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:43:54,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:54,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16041944] [2025-04-30 10:43:54,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16041944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:54,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:43:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993150424] [2025-04-30 10:43:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:54,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:43:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:54,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:43:54,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:43:54,203 INFO L87 Difference]: Start difference. First operand 211 states and 255 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:43:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:54,362 INFO L93 Difference]: Finished difference Result 223 states and 264 transitions. [2025-04-30 10:43:54,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:43:54,362 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-04-30 10:43:54,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:54,363 INFO L225 Difference]: With dead ends: 223 [2025-04-30 10:43:54,363 INFO L226 Difference]: Without dead ends: 217 [2025-04-30 10:43:54,363 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:43:54,364 INFO L437 NwaCegarLoop]: 196 mSDtfsCounter, 34 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:54,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 750 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-04-30 10:43:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2025-04-30 10:43:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 128 states have (on average 1.390625) internal successors, (178), 168 states have internal predecessors, (178), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 248 transitions. [2025-04-30 10:43:54,370 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 248 transitions. Word has length 38 [2025-04-30 10:43:54,370 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:54,370 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 248 transitions. [2025-04-30 10:43:54,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-30 10:43:54,372 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 248 transitions. [2025-04-30 10:43:54,372 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:43:54,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:54,373 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2025-04-30 10:43:54,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:43:54,373 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:54,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash -228737303, now seen corresponding path program 1 times [2025-04-30 10:43:54,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:54,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097199333] [2025-04-30 10:43:54,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:54,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:43:54,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:43:54,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:54,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-30 10:43:54,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:54,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097199333] [2025-04-30 10:43:54,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097199333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:54,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:54,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:43:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999892811] [2025-04-30 10:43:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:54,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:43:54,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:54,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:43:54,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:43:54,464 INFO L87 Difference]: Start difference. First operand 211 states and 248 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:54,509 INFO L93 Difference]: Finished difference Result 221 states and 260 transitions. [2025-04-30 10:43:54,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:43:54,510 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-04-30 10:43:54,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:54,511 INFO L225 Difference]: With dead ends: 221 [2025-04-30 10:43:54,511 INFO L226 Difference]: Without dead ends: 216 [2025-04-30 10:43:54,511 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:54,511 INFO L437 NwaCegarLoop]: 199 mSDtfsCounter, 22 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:54,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 768 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:43:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-30 10:43:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2025-04-30 10:43:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 128 states have (on average 1.3828125) internal successors, (177), 168 states have internal predecessors, (177), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2025-04-30 10:43:54,516 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 39 [2025-04-30 10:43:54,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:54,517 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2025-04-30 10:43:54,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:54,517 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2025-04-30 10:43:54,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:43:54,517 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:54,517 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:54,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:43:54,518 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:54,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1779518091, now seen corresponding path program 1 times [2025-04-30 10:43:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:54,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883625654] [2025-04-30 10:43:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:54,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:43:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:43:54,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-30 10:43:54,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:54,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883625654] [2025-04-30 10:43:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883625654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:54,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:54,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:43:54,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818185288] [2025-04-30 10:43:54,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:54,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:43:54,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:54,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:43:54,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:43:54,624 INFO L87 Difference]: Start difference. First operand 211 states and 247 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:54,766 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2025-04-30 10:43:54,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:43:54,766 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2025-04-30 10:43:54,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:54,767 INFO L225 Difference]: With dead ends: 209 [2025-04-30 10:43:54,767 INFO L226 Difference]: Without dead ends: 209 [2025-04-30 10:43:54,768 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:43:54,768 INFO L437 NwaCegarLoop]: 191 mSDtfsCounter, 9 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:54,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 764 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-30 10:43:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-04-30 10:43:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 128 states have (on average 1.3671875) internal successors, (175), 166 states have internal predecessors, (175), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2025-04-30 10:43:54,778 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 49 [2025-04-30 10:43:54,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:54,778 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2025-04-30 10:43:54,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:54,778 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2025-04-30 10:43:54,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-30 10:43:54,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:54,779 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:54,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:43:54,779 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:54,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1779518090, now seen corresponding path program 1 times [2025-04-30 10:43:54,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:54,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355623201] [2025-04-30 10:43:54,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:54,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:43:54,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:43:54,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:54,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:43:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:54,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355623201] [2025-04-30 10:43:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355623201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:54,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:43:54,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:43:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600181174] [2025-04-30 10:43:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:54,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:43:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:54,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:43:54,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:54,992 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:55,125 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. [2025-04-30 10:43:55,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:43:55,125 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2025-04-30 10:43:55,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:55,126 INFO L225 Difference]: With dead ends: 207 [2025-04-30 10:43:55,126 INFO L226 Difference]: Without dead ends: 207 [2025-04-30 10:43:55,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:43:55,127 INFO L437 NwaCegarLoop]: 191 mSDtfsCounter, 9 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:55,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 955 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:43:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-04-30 10:43:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-04-30 10:43:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 128 states have (on average 1.3515625) internal successors, (173), 164 states have internal predecessors, (173), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2025-04-30 10:43:55,134 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 49 [2025-04-30 10:43:55,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:55,134 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2025-04-30 10:43:55,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:55,134 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2025-04-30 10:43:55,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:43:55,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:55,135 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:55,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:43:55,135 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:55,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 669514231, now seen corresponding path program 1 times [2025-04-30 10:43:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:55,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133111350] [2025-04-30 10:43:55,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:55,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:43:55,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:43:55,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:55,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:43:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:55,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133111350] [2025-04-30 10:43:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133111350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:55,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265490287] [2025-04-30 10:43:55,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:55,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:55,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:55,484 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:43:55,485 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:43:55,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:43:55,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:43:55,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:55,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:55,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-30 10:43:55,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:55,632 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:55,671 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 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-30 10:43:55,675 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 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-30 10:43:55,720 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-30 10:43:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:43:55,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:43:55,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265490287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:55,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:43:55,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2025-04-30 10:43:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792661875] [2025-04-30 10:43:55,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:55,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:43:55,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:55,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:43:55,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:43:55,733 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:55,945 INFO L93 Difference]: Finished difference Result 211 states and 250 transitions. [2025-04-30 10:43:55,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:43:55,945 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-04-30 10:43:55,945 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:55,946 INFO L225 Difference]: With dead ends: 211 [2025-04-30 10:43:55,946 INFO L226 Difference]: Without dead ends: 211 [2025-04-30 10:43:55,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:43:55,947 INFO L437 NwaCegarLoop]: 194 mSDtfsCounter, 9 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:55,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1262 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:43:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-30 10:43:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2025-04-30 10:43:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 128 states have (on average 1.34375) internal successors, (172), 163 states have internal predecessors, (172), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 242 transitions. [2025-04-30 10:43:55,953 INFO L79 Accepts]: Start accepts. Automaton has 206 states and 242 transitions. Word has length 50 [2025-04-30 10:43:55,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:55,953 INFO L485 AbstractCegarLoop]: Abstraction has 206 states and 242 transitions. [2025-04-30 10:43:55,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:55,954 INFO L278 IsEmpty]: Start isEmpty. Operand 206 states and 242 transitions. [2025-04-30 10:43:55,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-30 10:43:55,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:55,954 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:43:55,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:56,154 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,SelfDestructingSolverStorable15 [2025-04-30 10:43:56,155 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:56,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash 669514232, now seen corresponding path program 1 times [2025-04-30 10:43:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:56,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059664341] [2025-04-30 10:43:56,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:56,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:43:56,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:43:56,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:56,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-30 10:43:56,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:56,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059664341] [2025-04-30 10:43:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059664341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:56,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538844820] [2025-04-30 10:43:56,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:56,478 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:43:56,480 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:43:56,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:43:56,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:43:56,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:56,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:56,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:43:56,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:56,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:56,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:56,760 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 47 treesize of output 29 [2025-04-30 10:43:56,763 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 38 treesize of output 26 [2025-04-30 10:43:56,771 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 51 treesize of output 29 [2025-04-30 10:43:56,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-04-30 10:43:56,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-04-30 10:43:56,841 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-30 10:43:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:43:56,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:43:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538844820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:56,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:43:56,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2025-04-30 10:43:56,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48845398] [2025-04-30 10:43:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:56,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:43:56,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:56,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:43:56,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:43:56,860 INFO L87 Difference]: Start difference. First operand 206 states and 242 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:57,220 INFO L93 Difference]: Finished difference Result 210 states and 249 transitions. [2025-04-30 10:43:57,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:43:57,220 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-04-30 10:43:57,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:57,221 INFO L225 Difference]: With dead ends: 210 [2025-04-30 10:43:57,221 INFO L226 Difference]: Without dead ends: 210 [2025-04-30 10:43:57,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:43:57,222 INFO L437 NwaCegarLoop]: 184 mSDtfsCounter, 14 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:57,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1742 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:43:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-30 10:43:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 205. [2025-04-30 10:43:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 128 states have (on average 1.3359375) internal successors, (171), 162 states have internal predecessors, (171), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-30 10:43:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 241 transitions. [2025-04-30 10:43:57,227 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 241 transitions. Word has length 50 [2025-04-30 10:43:57,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:57,227 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 241 transitions. [2025-04-30 10:43:57,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:43:57,227 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 241 transitions. [2025-04-30 10:43:57,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:43:57,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:57,229 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 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] [2025-04-30 10:43:57,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:57,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:43:57,430 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:57,430 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -300820591, now seen corresponding path program 1 times [2025-04-30 10:43:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:57,430 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970568618] [2025-04-30 10:43:57,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:57,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:43:57,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:43:57,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:57,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:43:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:43:58,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970568618] [2025-04-30 10:43:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970568618] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:43:58,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710542162] [2025-04-30 10:43:58,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:58,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:43:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:43:58,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:43:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:43:58,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:43:58,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:43:58,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:58,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:43:58,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-30 10:43:58,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:43:58,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:43:58,290 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2025-04-30 10:43:58,427 INFO L325 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-04-30 10:43:58,428 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2025-04-30 10:43:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:43:58,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:43:58,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710542162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:43:58,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:43:58,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 25 [2025-04-30 10:43:58,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879920340] [2025-04-30 10:43:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:43:58,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:43:58,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:43:58,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:43:58,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:43:58,515 INFO L87 Difference]: Start difference. First operand 205 states and 241 transitions. Second operand has 17 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:43:59,639 INFO L93 Difference]: Finished difference Result 258 states and 309 transitions. [2025-04-30 10:43:59,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:43:59,640 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2025-04-30 10:43:59,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:43:59,641 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:43:59,641 INFO L226 Difference]: Without dead ends: 258 [2025-04-30 10:43:59,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:43:59,642 INFO L437 NwaCegarLoop]: 148 mSDtfsCounter, 390 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 240 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:43:59,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 917 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1343 Invalid, 23 Unknown, 0 Unchecked, 0.9s Time] [2025-04-30 10:43:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-30 10:43:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 232. [2025-04-30 10:43:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 181 states have internal predecessors, (197), 40 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2025-04-30 10:43:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 280 transitions. [2025-04-30 10:43:59,652 INFO L79 Accepts]: Start accepts. Automaton has 232 states and 280 transitions. Word has length 57 [2025-04-30 10:43:59,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:43:59,652 INFO L485 AbstractCegarLoop]: Abstraction has 232 states and 280 transitions. [2025-04-30 10:43:59,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:43:59,653 INFO L278 IsEmpty]: Start isEmpty. Operand 232 states and 280 transitions. [2025-04-30 10:43:59,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-30 10:43:59,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:43:59,653 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 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] [2025-04-30 10:43:59,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:43:59,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:43:59,857 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:43:59,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:43:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -300820590, now seen corresponding path program 1 times [2025-04-30 10:43:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:43:59,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829354249] [2025-04-30 10:43:59,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:43:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:43:59,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:43:59,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:43:59,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:43:59,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:44:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:00,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829354249] [2025-04-30 10:44:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829354249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:00,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43174176] [2025-04-30 10:44:00,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:00,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:00,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:00,838 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:00,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:44:00,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:44:01,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:44:01,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:01,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:01,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-30 10:44:01,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:01,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-30 10:44:01,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-04-30 10:44:01,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:01,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:44:01,394 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-30 10:44:01,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2025-04-30 10:44:01,409 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-30 10:44:01,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2025-04-30 10:44:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-30 10:44:01,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:01,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43174176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:01,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:01,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [20] total 34 [2025-04-30 10:44:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366815046] [2025-04-30 10:44:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:01,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:44:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:01,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:44:01,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1083, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:44:01,576 INFO L87 Difference]: Start difference. First operand 232 states and 280 transitions. Second operand has 17 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:02,521 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2025-04-30 10:44:02,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:44:02,523 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2025-04-30 10:44:02,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:02,524 INFO L225 Difference]: With dead ends: 258 [2025-04-30 10:44:02,524 INFO L226 Difference]: Without dead ends: 258 [2025-04-30 10:44:02,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=1423, Unknown=0, NotChecked=0, Total=1560 [2025-04-30 10:44:02,524 INFO L437 NwaCegarLoop]: 151 mSDtfsCounter, 142 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:02,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 966 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-30 10:44:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-04-30 10:44:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 238. [2025-04-30 10:44:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 186 states have internal predecessors, (200), 41 states have call successors, (41), 13 states have call predecessors, (41), 14 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2025-04-30 10:44:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 285 transitions. [2025-04-30 10:44:02,531 INFO L79 Accepts]: Start accepts. Automaton has 238 states and 285 transitions. Word has length 57 [2025-04-30 10:44:02,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:02,531 INFO L485 AbstractCegarLoop]: Abstraction has 238 states and 285 transitions. [2025-04-30 10:44:02,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:44:02,532 INFO L278 IsEmpty]: Start isEmpty. Operand 238 states and 285 transitions. [2025-04-30 10:44:02,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:44:02,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:02,532 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-04-30 10:44:02,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:02,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:02,733 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:02,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1037694124, now seen corresponding path program 1 times [2025-04-30 10:44:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:02,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417919452] [2025-04-30 10:44:02,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:02,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:44:02,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:44:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:02,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-04-30 10:44:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:02,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417919452] [2025-04-30 10:44:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417919452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:02,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:02,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:44:02,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963363530] [2025-04-30 10:44:02,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:02,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:44:02,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:02,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:44:02,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:44:02,877 INFO L87 Difference]: Start difference. First operand 238 states and 285 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:44:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,068 INFO L93 Difference]: Finished difference Result 259 states and 309 transitions. [2025-04-30 10:44:03,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:44:03,068 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2025-04-30 10:44:03,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,069 INFO L225 Difference]: With dead ends: 259 [2025-04-30 10:44:03,069 INFO L226 Difference]: Without dead ends: 259 [2025-04-30 10:44:03,069 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:03,070 INFO L437 NwaCegarLoop]: 193 mSDtfsCounter, 53 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:03,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 865 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:44:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-04-30 10:44:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2025-04-30 10:44:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 192 states have internal predecessors, (208), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-04-30 10:44:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 295 transitions. [2025-04-30 10:44:03,078 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 295 transitions. Word has length 64 [2025-04-30 10:44:03,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,078 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 295 transitions. [2025-04-30 10:44:03,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:44:03,079 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 295 transitions. [2025-04-30 10:44:03,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-30 10:44:03,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,080 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-04-30 10:44:03,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:44:03,080 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:03,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1037694123, now seen corresponding path program 1 times [2025-04-30 10:44:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781658013] [2025-04-30 10:44:03,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-30 10:44:03,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-30 10:44:03,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-30 10:44:03,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781658013] [2025-04-30 10:44:03,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781658013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:03,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:03,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:44:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708862920] [2025-04-30 10:44:03,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:03,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:03,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:03,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:44:03,372 INFO L87 Difference]: Start difference. First operand 246 states and 295 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:44:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:03,668 INFO L93 Difference]: Finished difference Result 260 states and 309 transitions. [2025-04-30 10:44:03,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:03,668 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2025-04-30 10:44:03,668 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:03,669 INFO L225 Difference]: With dead ends: 260 [2025-04-30 10:44:03,669 INFO L226 Difference]: Without dead ends: 260 [2025-04-30 10:44:03,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:44:03,670 INFO L437 NwaCegarLoop]: 184 mSDtfsCounter, 59 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:03,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1264 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-30 10:44:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 246. [2025-04-30 10:44:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 157 states have (on average 1.3184713375796178) internal successors, (207), 192 states have internal predecessors, (207), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-04-30 10:44:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 294 transitions. [2025-04-30 10:44:03,675 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 294 transitions. Word has length 64 [2025-04-30 10:44:03,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:03,675 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 294 transitions. [2025-04-30 10:44:03,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:44:03,675 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 294 transitions. [2025-04-30 10:44:03,676 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-30 10:44:03,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:03,676 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-04-30 10:44:03,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:44:03,676 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:03,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:03,676 INFO L85 PathProgramCache]: Analyzing trace with hash 121872637, now seen corresponding path program 1 times [2025-04-30 10:44:03,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:03,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769194964] [2025-04-30 10:44:03,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:03,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:44:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:44:03,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:03,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-30 10:44:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:03,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769194964] [2025-04-30 10:44:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769194964] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:03,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128167012] [2025-04-30 10:44:03,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:03,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:03,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:03,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:03,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:44:04,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:44:04,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:44:04,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:04,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-30 10:44:04,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-30 10:44:04,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:04,121 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-30 10:44:04,121 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 12 treesize of output 11 [2025-04-30 10:44:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-30 10:44:04,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128167012] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:04,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:04,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2025-04-30 10:44:04,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230604992] [2025-04-30 10:44:04,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:04,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:44:04,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:04,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:44:04,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:44:04,134 INFO L87 Difference]: Start difference. First operand 246 states and 294 transitions. Second operand has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:44:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:04,487 INFO L93 Difference]: Finished difference Result 270 states and 322 transitions. [2025-04-30 10:44:04,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:44:04,490 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2025-04-30 10:44:04,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:04,491 INFO L225 Difference]: With dead ends: 270 [2025-04-30 10:44:04,491 INFO L226 Difference]: Without dead ends: 270 [2025-04-30 10:44:04,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:44:04,492 INFO L437 NwaCegarLoop]: 213 mSDtfsCounter, 102 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:04,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1271 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-30 10:44:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 247. [2025-04-30 10:44:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 192 states have internal predecessors, (209), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (45), 42 states have call predecessors, (45), 42 states have call successors, (45) [2025-04-30 10:44:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2025-04-30 10:44:04,499 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 74 [2025-04-30 10:44:04,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:04,500 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2025-04-30 10:44:04,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:44:04,500 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2025-04-30 10:44:04,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-30 10:44:04,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:04,500 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-04-30 10:44:04,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:04,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-30 10:44:04,701 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:04,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash 121872638, now seen corresponding path program 1 times [2025-04-30 10:44:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:04,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248498665] [2025-04-30 10:44:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:04,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:44:04,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:44:04,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:04,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:44:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:05,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248498665] [2025-04-30 10:44:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248498665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:05,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496357802] [2025-04-30 10:44:05,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:05,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:05,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:05,074 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:05,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:44:05,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-30 10:44:05,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-30 10:44:05,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:05,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:05,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-30 10:44:05,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-30 10:44:05,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:05,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-30 10:44:05,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:05,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-04-30 10:44:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-04-30 10:44:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496357802] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:05,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:05,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2025-04-30 10:44:05,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952138222] [2025-04-30 10:44:05,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:05,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:44:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:05,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:44:05,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:44:05,604 INFO L87 Difference]: Start difference. First operand 247 states and 296 transitions. Second operand has 25 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (12), 7 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-30 10:44:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:06,536 INFO L93 Difference]: Finished difference Result 386 states and 473 transitions. [2025-04-30 10:44:06,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:44:06,537 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (12), 7 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-04-30 10:44:06,537 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:06,538 INFO L225 Difference]: With dead ends: 386 [2025-04-30 10:44:06,538 INFO L226 Difference]: Without dead ends: 386 [2025-04-30 10:44:06,539 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:44:06,539 INFO L437 NwaCegarLoop]: 302 mSDtfsCounter, 307 mSDsluCounter, 3825 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 4127 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:06,539 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 4127 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-30 10:44:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-30 10:44:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 342. [2025-04-30 10:44:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 218 states have (on average 1.385321100917431) internal successors, (302), 254 states have internal predecessors, (302), 74 states have call successors, (74), 18 states have call predecessors, (74), 19 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-04-30 10:44:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 454 transitions. [2025-04-30 10:44:06,548 INFO L79 Accepts]: Start accepts. Automaton has 342 states and 454 transitions. Word has length 74 [2025-04-30 10:44:06,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:06,549 INFO L485 AbstractCegarLoop]: Abstraction has 342 states and 454 transitions. [2025-04-30 10:44:06,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (12), 7 states have call predecessors, (12), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-04-30 10:44:06,549 INFO L278 IsEmpty]: Start isEmpty. Operand 342 states and 454 transitions. [2025-04-30 10:44:06,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-04-30 10:44:06,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:06,549 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-04-30 10:44:06,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:06,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:06,750 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:06,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1089531799, now seen corresponding path program 2 times [2025-04-30 10:44:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:06,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644732081] [2025-04-30 10:44:06,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:06,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-04-30 10:44:06,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-04-30 10:44:06,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:06,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:44:07,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:07,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644732081] [2025-04-30 10:44:07,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644732081] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:07,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942004862] [2025-04-30 10:44:07,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:44:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:07,131 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:07,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:44:07,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-04-30 10:44:07,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-04-30 10:44:07,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:44:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:07,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-30 10:44:07,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-30 10:44:07,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:07,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-30 10:44:07,885 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:44:07,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-04-30 10:44:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-30 10:44:08,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942004862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:08,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:08,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 41 [2025-04-30 10:44:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910721500] [2025-04-30 10:44:08,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:08,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-30 10:44:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:08,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-30 10:44:08,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:44:08,020 INFO L87 Difference]: Start difference. First operand 342 states and 454 transitions. Second operand has 42 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 30 states have internal predecessors, (140), 13 states have call successors, (22), 11 states have call predecessors, (22), 8 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2025-04-30 10:44:12,030 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:44:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:13,334 INFO L93 Difference]: Finished difference Result 390 states and 474 transitions. [2025-04-30 10:44:13,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:44:13,334 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 30 states have internal predecessors, (140), 13 states have call successors, (22), 11 states have call predecessors, (22), 8 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) Word has length 81 [2025-04-30 10:44:13,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:13,336 INFO L225 Difference]: With dead ends: 390 [2025-04-30 10:44:13,336 INFO L226 Difference]: Without dead ends: 390 [2025-04-30 10:44:13,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=2519, Unknown=0, NotChecked=0, Total=2756 [2025-04-30 10:44:13,337 INFO L437 NwaCegarLoop]: 158 mSDtfsCounter, 638 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 2605 mSolverCounterSat, 214 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 2605 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:13,337 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 3142 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 2605 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-04-30 10:44:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-04-30 10:44:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 352. [2025-04-30 10:44:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 262 states have internal predecessors, (309), 74 states have call successors, (74), 20 states have call predecessors, (74), 21 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-04-30 10:44:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 461 transitions. [2025-04-30 10:44:13,344 INFO L79 Accepts]: Start accepts. Automaton has 352 states and 461 transitions. Word has length 81 [2025-04-30 10:44:13,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:13,344 INFO L485 AbstractCegarLoop]: Abstraction has 352 states and 461 transitions. [2025-04-30 10:44:13,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 3.6842105263157894) internal successors, (140), 30 states have internal predecessors, (140), 13 states have call successors, (22), 11 states have call predecessors, (22), 8 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2025-04-30 10:44:13,344 INFO L278 IsEmpty]: Start isEmpty. Operand 352 states and 461 transitions. [2025-04-30 10:44:13,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-04-30 10:44:13,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:13,345 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:13,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:13,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-30 10:44:13,546 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:13,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1021119326, now seen corresponding path program 1 times [2025-04-30 10:44:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:13,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127246826] [2025-04-30 10:44:13,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:13,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-30 10:44:13,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:44:13,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:13,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-30 10:44:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:13,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127246826] [2025-04-30 10:44:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127246826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:13,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:44:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:44:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316294070] [2025-04-30 10:44:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:13,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:44:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:13,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:44:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:13,594 INFO L87 Difference]: Start difference. First operand 352 states and 461 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-30 10:44:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:13,600 INFO L93 Difference]: Finished difference Result 355 states and 461 transitions. [2025-04-30 10:44:13,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:44:13,601 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 80 [2025-04-30 10:44:13,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:13,602 INFO L225 Difference]: With dead ends: 355 [2025-04-30 10:44:13,602 INFO L226 Difference]: Without dead ends: 352 [2025-04-30 10:44:13,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:44:13,602 INFO L437 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:13,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:44:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-30 10:44:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-04-30 10:44:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 226 states have (on average 1.3539823008849559) internal successors, (306), 262 states have internal predecessors, (306), 74 states have call successors, (74), 20 states have call predecessors, (74), 21 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-04-30 10:44:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 458 transitions. [2025-04-30 10:44:13,609 INFO L79 Accepts]: Start accepts. Automaton has 352 states and 458 transitions. Word has length 80 [2025-04-30 10:44:13,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:13,610 INFO L485 AbstractCegarLoop]: Abstraction has 352 states and 458 transitions. [2025-04-30 10:44:13,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-30 10:44:13,610 INFO L278 IsEmpty]: Start isEmpty. Operand 352 states and 458 transitions. [2025-04-30 10:44:13,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-04-30 10:44:13,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:13,610 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:44:13,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:44:13,610 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:13,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash -56832772, now seen corresponding path program 1 times [2025-04-30 10:44:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:13,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281893600] [2025-04-30 10:44:13,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-30 10:44:13,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-30 10:44:13,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:13,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:44:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:13,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281893600] [2025-04-30 10:44:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281893600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:13,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732208171] [2025-04-30 10:44:13,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:44:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:13,912 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:13,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:44:14,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-30 10:44:14,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-30 10:44:14,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:44:14,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:14,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-30 10:44:14,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:14,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:44:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-04-30 10:44:14,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:44:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732208171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:44:14,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:44:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2025-04-30 10:44:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626457765] [2025-04-30 10:44:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:44:14,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:44:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:14,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:44:14,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:44:14,349 INFO L87 Difference]: Start difference. First operand 352 states and 458 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:44:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:14,519 INFO L93 Difference]: Finished difference Result 354 states and 450 transitions. [2025-04-30 10:44:14,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:44:14,520 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 87 [2025-04-30 10:44:14,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:14,521 INFO L225 Difference]: With dead ends: 354 [2025-04-30 10:44:14,521 INFO L226 Difference]: Without dead ends: 343 [2025-04-30 10:44:14,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:44:14,521 INFO L437 NwaCegarLoop]: 191 mSDtfsCounter, 57 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:14,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1438 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:44:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-04-30 10:44:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2025-04-30 10:44:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 251 states have internal predecessors, (290), 70 states have call successors, (70), 19 states have call predecessors, (70), 21 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-04-30 10:44:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 434 transitions. [2025-04-30 10:44:14,529 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 434 transitions. Word has length 87 [2025-04-30 10:44:14,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:14,530 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 434 transitions. [2025-04-30 10:44:14,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-30 10:44:14,531 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 434 transitions. [2025-04-30 10:44:14,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-04-30 10:44:14,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:14,532 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-04-30 10:44:14,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-30 10:44:14,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-30 10:44:14,733 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:14,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash -834118382, now seen corresponding path program 3 times [2025-04-30 10:44:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:14,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195140400] [2025-04-30 10:44:14,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:44:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:14,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 4 equivalence classes. [2025-04-30 10:44:14,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 63 of 91 statements. [2025-04-30 10:44:14,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:44:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-04-30 10:44:15,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:15,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195140400] [2025-04-30 10:44:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195140400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:15,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202412001] [2025-04-30 10:44:15,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:44:15,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:15,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:15,527 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:15,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:44:15,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 4 equivalence classes. [2025-04-30 10:44:15,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 63 of 91 statements. [2025-04-30 10:44:15,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:44:15,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:15,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:44:15,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-30 10:44:15,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-30 10:44:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202412001] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:16,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7, 7] total 26 [2025-04-30 10:44:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553884871] [2025-04-30 10:44:16,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:16,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-30 10:44:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:16,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-30 10:44:16,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:44:16,074 INFO L87 Difference]: Start difference. First operand 337 states and 434 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 25 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:44:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:44:16,757 INFO L93 Difference]: Finished difference Result 359 states and 470 transitions. [2025-04-30 10:44:16,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:44:16,758 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 25 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2025-04-30 10:44:16,758 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:44:16,760 INFO L225 Difference]: With dead ends: 359 [2025-04-30 10:44:16,760 INFO L226 Difference]: Without dead ends: 353 [2025-04-30 10:44:16,760 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:44:16,760 INFO L437 NwaCegarLoop]: 182 mSDtfsCounter, 71 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:44:16,761 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2555 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:44:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-04-30 10:44:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2025-04-30 10:44:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 222 states have (on average 1.3468468468468469) internal successors, (299), 258 states have internal predecessors, (299), 70 states have call successors, (70), 19 states have call predecessors, (70), 21 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-04-30 10:44:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 443 transitions. [2025-04-30 10:44:16,770 INFO L79 Accepts]: Start accepts. Automaton has 344 states and 443 transitions. Word has length 91 [2025-04-30 10:44:16,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:44:16,770 INFO L485 AbstractCegarLoop]: Abstraction has 344 states and 443 transitions. [2025-04-30 10:44:16,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 25 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-04-30 10:44:16,770 INFO L278 IsEmpty]: Start isEmpty. Operand 344 states and 443 transitions. [2025-04-30 10:44:16,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-04-30 10:44:16,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:44:16,771 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-04-30 10:44:16,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-30 10:44:16,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:44:16,972 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-30 10:44:16,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:44:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 760450834, now seen corresponding path program 4 times [2025-04-30 10:44:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:44:16,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302265846] [2025-04-30 10:44:16,972 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:44:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:44:16,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-04-30 10:44:16,998 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 95 statements. [2025-04-30 10:44:16,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:44:16,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-04-30 10:44:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:44:17,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302265846] [2025-04-30 10:44:17,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302265846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:44:17,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120667222] [2025-04-30 10:44:17,280 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:44:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:44:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:44:17,281 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:44:17,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:44:17,476 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 95 statements into 2 equivalence classes. [2025-04-30 10:44:17,544 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 95 statements. [2025-04-30 10:44:17,545 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:44:17,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:44:17,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-30 10:44:17,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:44:17,554 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:44:18,080 INFO L325 Elim1Store]: treesize reduction 6, result has 91.8 percent of original size [2025-04-30 10:44:18,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 83 [2025-04-30 10:44:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 29 proven. 16 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-04-30 10:44:18,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:44:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-04-30 10:44:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120667222] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:44:19,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:44:19,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 48 [2025-04-30 10:44:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721169170] [2025-04-30 10:44:19,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:44:19,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-30 10:44:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:44:19,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-30 10:44:19,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2113, Unknown=0, NotChecked=0, Total=2256 [2025-04-30 10:44:19,052 INFO L87 Difference]: Start difference. First operand 344 states and 443 transitions. Second operand has 48 states, 43 states have (on average 2.395348837209302) internal successors, (103), 40 states have internal predecessors, (103), 15 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (16), 14 states have call predecessors, (16), 10 states have call successors, (16) [2025-04-30 10:44:23,081 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:44:27,100 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:44:31,127 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:44:35,144 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:44:39,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:44:43,211 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-30 10:44:48,101 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15