./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 22:46:33,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:46:33,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:46:33,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:46:33,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:46:33,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:46:33,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:46:33,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:46:33,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:46:33,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:46:33,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:46:33,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:46:33,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:46:33,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:46:33,905 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:46:33,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:46:33,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:46:33,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:46:33,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:46:33,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:46:33,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:46:33,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:46:33,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:46:33,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:46:33,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:46:33,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:46:33,908 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-03-08 22:46:34,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:46:34,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:46:34,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:46:34,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:46:34,126 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:46:34,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2025-03-08 22:46:35,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8133b8f2c/35789686181f4f9f877ae841b3334b6a/FLAGe59243ae2 [2025-03-08 22:46:35,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:46:35,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2025-03-08 22:46:35,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8133b8f2c/35789686181f4f9f877ae841b3334b6a/FLAGe59243ae2 [2025-03-08 22:46:35,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8133b8f2c/35789686181f4f9f877ae841b3334b6a [2025-03-08 22:46:35,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:46:35,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:46:35,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:46:35,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:46:35,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:46:35,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:35" (1/1) ... [2025-03-08 22:46:35,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35289ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:35, skipping insertion in model container [2025-03-08 22:46:35,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:46:35" (1/1) ... [2025-03-08 22:46:35,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:46:36,219 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:46:36,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:46:36,245 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:46:36,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:46:36,337 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:46:36,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36 WrapperNode [2025-03-08 22:46:36,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:46:36,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:46:36,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:46:36,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:46:36,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,380 INFO L138 Inliner]: procedures = 283, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-08 22:46:36,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:46:36,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:46:36,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:46:36,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:46:36,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,410 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 9, 2, 17]. 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, 2, 8]. [2025-03-08 22:46:36,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:46:36,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:46:36,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:46:36,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:46:36,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (1/1) ... [2025-03-08 22:46:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:46:36,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:36,460 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-03-08 22:46:36,463 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-03-08 22:46:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2025-03-08 22:46:36,478 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2025-03-08 22:46:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:46:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:46:36,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2025-03-08 22:46:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2025-03-08 22:46:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2025-03-08 22:46:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2025-03-08 22:46:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2025-03-08 22:46:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 22:46:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2025-03-08 22:46:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2025-03-08 22:46:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2025-03-08 22:46:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2025-03-08 22:46:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:46:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:46:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:46:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 22:46:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:46:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:46:36,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:46:36,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:46:36,618 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L890: havoc #t~mem31; [2025-03-08 22:46:36,901 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L966: call ULTIMATE.dealloc(main_~#cf~0#1.base, main_~#cf~0#1.offset);havoc main_~#cf~0#1.base, main_~#cf~0#1.offset;call ULTIMATE.dealloc(main_~#cg~0#1.base, main_~#cg~0#1.offset);havoc main_~#cg~0#1.base, main_~#cg~0#1.offset; [2025-03-08 22:46:36,951 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-03-08 22:46:36,951 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:46:36,959 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:46:36,960 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:46:36,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:36 BoogieIcfgContainer [2025-03-08 22:46:36,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:46:36,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:46:36,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:46:36,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:46:36,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:46:35" (1/3) ... [2025-03-08 22:46:36,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fdf36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:36, skipping insertion in model container [2025-03-08 22:46:36,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:46:36" (2/3) ... [2025-03-08 22:46:36,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fdf36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:46:36, skipping insertion in model container [2025-03-08 22:46:36,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:36" (3/3) ... [2025-03-08 22:46:36,967 INFO L128 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2025-03-08 22:46:36,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:46:36,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 20020406-1.i that has 9 procedures, 192 locations, 1 initial locations, 3 loop locations, and 55 error locations. [2025-03-08 22:46:37,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:46:37,015 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fbe33d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:46:37,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-03-08 22:46:37,020 INFO L276 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-03-08 22:46:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:46:37,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:37,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:46:37,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:37,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 216661483, now seen corresponding path program 1 times [2025-03-08 22:46:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570573310] [2025-03-08 22:46:37,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:37,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:46:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:46:37,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:37,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570573310] [2025-03-08 22:46:37,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570573310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:37,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:37,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:37,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102592330] [2025-03-08 22:46:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:37,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:37,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:37,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:37,235 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-03-08 22:46:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:37,382 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-03-08 22:46:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:37,384 INFO L78 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-03-08 22:46:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:37,390 INFO L225 Difference]: With dead ends: 187 [2025-03-08 22:46:37,391 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 22:46:37,393 INFO L434 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-03-08 22:46:37,396 INFO L435 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-03-08 22:46:37,396 INFO L436 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-03-08 22:46:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 22:46:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-08 22:46:37,436 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-03-08 22:46:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2025-03-08 22:46:37,441 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 5 [2025-03-08 22:46:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:37,442 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2025-03-08 22:46:37,442 INFO L472 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-03-08 22:46:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2025-03-08 22:46:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:46:37,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:37,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:46:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:46:37,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash 216661484, now seen corresponding path program 1 times [2025-03-08 22:46:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728191261] [2025-03-08 22:46:37,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:37,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:46:37,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:46:37,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:37,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:37,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728191261] [2025-03-08 22:46:37,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728191261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:37,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:37,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:46:37,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198422789] [2025-03-08 22:46:37,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:37,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:46:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:37,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:46:37,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:46:37,577 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-03-08 22:46:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:37,689 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-03-08 22:46:37,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:37,690 INFO L78 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-03-08 22:46:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:37,691 INFO L225 Difference]: With dead ends: 187 [2025-03-08 22:46:37,692 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 22:46:37,693 INFO L434 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-03-08 22:46:37,693 INFO L435 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-03-08 22:46:37,693 INFO L436 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-03-08 22:46:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 22:46:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2025-03-08 22:46:37,707 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-03-08 22:46:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2025-03-08 22:46:37,711 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 5 [2025-03-08 22:46:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:37,711 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2025-03-08 22:46:37,712 INFO L472 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-03-08 22:46:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2025-03-08 22:46:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:46:37,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:37,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:37,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:46:37,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:37,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2053254985, now seen corresponding path program 1 times [2025-03-08 22:46:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234251286] [2025-03-08 22:46:37,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:37,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:46:37,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:46:37,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:37,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:37,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:37,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234251286] [2025-03-08 22:46:37,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234251286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:37,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:46:37,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127756144] [2025-03-08 22:46:37,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:37,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:46:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:37,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:46:37,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:46:37,920 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-03-08 22:46:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:38,052 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-08 22:46:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:46:38,052 INFO L78 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-03-08 22:46:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:38,053 INFO L225 Difference]: With dead ends: 182 [2025-03-08 22:46:38,053 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 22:46:38,054 INFO L434 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-03-08 22:46:38,054 INFO L435 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-03-08 22:46:38,054 INFO L436 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-03-08 22:46:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 22:46:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-03-08 22:46:38,066 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-03-08 22:46:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-03-08 22:46:38,069 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 7 [2025-03-08 22:46:38,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:38,069 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-03-08 22:46:38,069 INFO L472 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-03-08 22:46:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-03-08 22:46:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:46:38,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:38,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:38,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:46:38,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:38,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash 329766595, now seen corresponding path program 1 times [2025-03-08 22:46:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462746789] [2025-03-08 22:46:38,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:38,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:46:38,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:46:38,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:38,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:38,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462746789] [2025-03-08 22:46:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462746789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:38,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021089639] [2025-03-08 22:46:38,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:38,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:38,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:38,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:38,197 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-03-08 22:46:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:38,379 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-08 22:46:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:38,381 INFO L78 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-03-08 22:46:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:38,382 INFO L225 Difference]: With dead ends: 182 [2025-03-08 22:46:38,383 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 22:46:38,383 INFO L434 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-03-08 22:46:38,383 INFO L435 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-03-08 22:46:38,385 INFO L436 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-03-08 22:46:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 22:46:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-03-08 22:46:38,395 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-03-08 22:46:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 215 transitions. [2025-03-08 22:46:38,398 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 215 transitions. Word has length 11 [2025-03-08 22:46:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:38,398 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 215 transitions. [2025-03-08 22:46:38,398 INFO L472 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-03-08 22:46:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 215 transitions. [2025-03-08 22:46:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:46:38,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:38,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:46:38,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:38,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1632829842, now seen corresponding path program 1 times [2025-03-08 22:46:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240469766] [2025-03-08 22:46:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:46:38,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:46:38,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:38,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:38,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:38,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240469766] [2025-03-08 22:46:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240469766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:38,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:46:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708848016] [2025-03-08 22:46:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:38,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:46:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:38,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:46:38,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:38,634 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-03-08 22:46:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:38,883 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-03-08 22:46:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:46:38,884 INFO L78 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-03-08 22:46:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:38,885 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:46:38,885 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 22:46:38,885 INFO L434 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-03-08 22:46:38,886 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 25 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-03-08 22:46:38,886 INFO L436 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-03-08 22:46:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 22:46:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-08 22:46:38,898 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-03-08 22:46:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2025-03-08 22:46:38,899 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 12 [2025-03-08 22:46:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:38,899 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2025-03-08 22:46:38,900 INFO L472 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-03-08 22:46:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2025-03-08 22:46:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:46:38,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:38,900 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-03-08 22:46:38,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:46:38,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:38,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1085343452, now seen corresponding path program 1 times [2025-03-08 22:46:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711932110] [2025-03-08 22:46:38,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:38,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:46:38,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:46:38,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:38,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:38,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:38,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711932110] [2025-03-08 22:46:38,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711932110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:38,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:38,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151988959] [2025-03-08 22:46:38,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:38,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:38,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:38,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:38,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:38,984 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-03-08 22:46:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:39,135 INFO L93 Difference]: Finished difference Result 193 states and 229 transitions. [2025-03-08 22:46:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:39,138 INFO L78 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-03-08 22:46:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:39,139 INFO L225 Difference]: With dead ends: 193 [2025-03-08 22:46:39,139 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 22:46:39,139 INFO L434 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-03-08 22:46:39,139 INFO L435 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-03-08 22:46:39,139 INFO L436 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-03-08 22:46:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 22:46:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-08 22:46:39,146 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-03-08 22:46:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 229 transitions. [2025-03-08 22:46:39,147 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 229 transitions. Word has length 21 [2025-03-08 22:46:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:39,147 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 229 transitions. [2025-03-08 22:46:39,147 INFO L472 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-03-08 22:46:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 229 transitions. [2025-03-08 22:46:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:46:39,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:39,148 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-03-08 22:46:39,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:46:39,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1085343451, now seen corresponding path program 1 times [2025-03-08 22:46:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420818935] [2025-03-08 22:46:39,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:39,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:46:39,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:46:39,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:39,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:39,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:39,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420818935] [2025-03-08 22:46:39,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420818935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:39,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:39,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:46:39,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734185217] [2025-03-08 22:46:39,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:39,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:39,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:39,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:39,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:39,280 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-03-08 22:46:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:39,440 INFO L93 Difference]: Finished difference Result 191 states and 227 transitions. [2025-03-08 22:46:39,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:39,440 INFO L78 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-03-08 22:46:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:39,442 INFO L225 Difference]: With dead ends: 191 [2025-03-08 22:46:39,442 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 22:46:39,442 INFO L434 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-03-08 22:46:39,442 INFO L435 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-03-08 22:46:39,442 INFO L436 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-03-08 22:46:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 22:46:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-08 22:46:39,447 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-03-08 22:46:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2025-03-08 22:46:39,449 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 21 [2025-03-08 22:46:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:39,449 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2025-03-08 22:46:39,449 INFO L472 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-03-08 22:46:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2025-03-08 22:46:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:46:39,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:39,450 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-03-08 22:46:39,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:46:39,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:39,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash 714091514, now seen corresponding path program 1 times [2025-03-08 22:46:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326265162] [2025-03-08 22:46:39,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:39,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:46:39,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:46:39,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:39,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:39,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326265162] [2025-03-08 22:46:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326265162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:39,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:39,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:46:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110719119] [2025-03-08 22:46:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:39,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:39,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:39,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:39,657 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-03-08 22:46:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:39,749 INFO L93 Difference]: Finished difference Result 217 states and 260 transitions. [2025-03-08 22:46:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:46:39,751 INFO L78 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-03-08 22:46:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:39,753 INFO L225 Difference]: With dead ends: 217 [2025-03-08 22:46:39,754 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 22:46:39,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:46:39,755 INFO L435 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-03-08 22:46:39,755 INFO L436 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-03-08 22:46:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 22:46:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-03-08 22:46:39,763 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-03-08 22:46:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-03-08 22:46:39,765 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 22 [2025-03-08 22:46:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:39,765 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-03-08 22:46:39,765 INFO L472 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-03-08 22:46:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-03-08 22:46:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:46:39,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:39,766 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-03-08 22:46:39,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:46:39,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1744966729, now seen corresponding path program 1 times [2025-03-08 22:46:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158157815] [2025-03-08 22:46:39,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:39,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:46:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:46:39,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:39,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:40,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:40,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158157815] [2025-03-08 22:46:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158157815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:40,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834214530] [2025-03-08 22:46:40,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:40,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:40,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:40,030 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-03-08 22:46:40,032 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-03-08 22:46:40,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:46:40,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:46:40,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:40,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:40,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:46:40,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:40,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:40,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:46:40,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 22:46:40,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 22:46:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:40,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834214530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-08 22:46:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104104041] [2025-03-08 22:46:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:40,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:46:40,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:40,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:46:40,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:46:40,277 INFO L87 Difference]: Start difference. First operand 209 states and 252 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-03-08 22:46:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:40,525 INFO L93 Difference]: Finished difference Result 213 states and 260 transitions. [2025-03-08 22:46:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:46:40,526 INFO L78 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-03-08 22:46:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:40,527 INFO L225 Difference]: With dead ends: 213 [2025-03-08 22:46:40,527 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 22:46:40,527 INFO L434 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-03-08 22:46:40,527 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 9 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:40,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1295 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 22:46:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2025-03-08 22:46:40,534 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-03-08 22:46:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2025-03-08 22:46:40,535 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 23 [2025-03-08 22:46:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:40,536 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2025-03-08 22:46:40,536 INFO L472 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-03-08 22:46:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2025-03-08 22:46:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:46:40,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:40,536 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-03-08 22:46:40,544 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-03-08 22:46:40,737 WARN L453 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-03-08 22:46:40,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1744966730, now seen corresponding path program 1 times [2025-03-08 22:46:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228796800] [2025-03-08 22:46:40,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:40,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:46:40,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:46:40,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:40,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228796800] [2025-03-08 22:46:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228796800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722295996] [2025-03-08 22:46:40,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:40,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:40,961 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-03-08 22:46:40,962 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-03-08 22:46:41,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:46:41,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:46:41,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:41,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:41,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 22:46:41,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:41,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:41,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:41,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2025-03-08 22:46:41,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-08 22:46:41,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-03-08 22:46:41,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-03-08 22:46:41,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-08 22:46:41,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-08 22:46:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:41,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722295996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:41,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:41,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-03-08 22:46:41,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459852231] [2025-03-08 22:46:41,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:41,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:46:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:41,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:46:41,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:46:41,326 INFO L87 Difference]: Start difference. First operand 208 states and 251 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-03-08 22:46:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:41,687 INFO L93 Difference]: Finished difference Result 212 states and 259 transitions. [2025-03-08 22:46:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:46:41,688 INFO L78 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-03-08 22:46:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:41,689 INFO L225 Difference]: With dead ends: 212 [2025-03-08 22:46:41,689 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 22:46:41,689 INFO L434 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-03-08 22:46:41,690 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 14 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:41,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1447 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 22:46:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2025-03-08 22:46:41,697 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-03-08 22:46:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2025-03-08 22:46:41,698 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 23 [2025-03-08 22:46:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:41,698 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2025-03-08 22:46:41,698 INFO L472 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-03-08 22:46:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2025-03-08 22:46:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 22:46:41,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:41,699 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-03-08 22:46:41,705 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-03-08 22:46:41,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 22:46:41,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:41,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:41,903 INFO L85 PathProgramCache]: Analyzing trace with hash 150088281, now seen corresponding path program 1 times [2025-03-08 22:46:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:41,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579426137] [2025-03-08 22:46:41,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:41,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:41,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:46:41,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:46:41,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:41,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:46:42,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579426137] [2025-03-08 22:46:42,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579426137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672931320] [2025-03-08 22:46:42,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:42,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:42,123 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-03-08 22:46:42,125 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-03-08 22:46:42,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:46:42,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:46:42,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:42,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:42,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 22:46:42,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:42,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 22:46:42,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:42,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:46:42,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:46:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:42,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:42,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672931320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:42,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:42,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-03-08 22:46:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006750560] [2025-03-08 22:46:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:42,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:46:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:42,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:46:42,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:46:42,388 INFO L87 Difference]: Start difference. First operand 207 states and 250 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-03-08 22:46:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:42,647 INFO L93 Difference]: Finished difference Result 215 states and 256 transitions. [2025-03-08 22:46:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:46:42,648 INFO L78 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 35 [2025-03-08 22:46:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:42,649 INFO L225 Difference]: With dead ends: 215 [2025-03-08 22:46:42,649 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 22:46:42,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:46:42,649 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 28 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:42,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1204 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 22:46:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2025-03-08 22:46:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 123 states have (on average 1.4065040650406504) internal successors, (173), 163 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-03-08 22:46:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2025-03-08 22:46:42,655 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 35 [2025-03-08 22:46:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:42,655 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2025-03-08 22:46:42,655 INFO L472 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-03-08 22:46:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2025-03-08 22:46:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 22:46:42,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:42,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:46:42,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:46:42,860 WARN L453 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-03-08 22:46:42,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1173037684, now seen corresponding path program 1 times [2025-03-08 22:46:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:42,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167659724] [2025-03-08 22:46:42,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:42,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:42,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 22:46:42,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 22:46:42,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:42,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:46:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167659724] [2025-03-08 22:46:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167659724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484145678] [2025-03-08 22:46:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:46:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:42,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:46:42,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:46:42,926 INFO L87 Difference]: Start difference. First operand 206 states and 243 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-03-08 22:46:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:42,964 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2025-03-08 22:46:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:46:42,964 INFO L78 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 36 [2025-03-08 22:46:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:42,965 INFO L225 Difference]: With dead ends: 216 [2025-03-08 22:46:42,965 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 22:46:42,965 INFO L434 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-03-08 22:46:42,966 INFO L435 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-03-08 22:46:42,966 INFO L436 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-03-08 22:46:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 22:46:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2025-03-08 22:46:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 123 states have (on average 1.3983739837398375) 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-03-08 22:46:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 242 transitions. [2025-03-08 22:46:42,971 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 242 transitions. Word has length 36 [2025-03-08 22:46:42,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:42,971 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 242 transitions. [2025-03-08 22:46:42,971 INFO L472 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-03-08 22:46:42,971 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 242 transitions. [2025-03-08 22:46:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 22:46:42,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:42,973 INFO L218 NwaCegarLoop]: trace histogram [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-03-08 22:46:42,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:46:42,974 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:42,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1722566853, now seen corresponding path program 1 times [2025-03-08 22:46:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:42,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471690906] [2025-03-08 22:46:42,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:42,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 22:46:42,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 22:46:42,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:42,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471690906] [2025-03-08 22:46:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471690906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:43,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:46:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850229665] [2025-03-08 22:46:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:43,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:46:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:43,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:46:43,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:46:43,071 INFO L87 Difference]: Start difference. First operand 206 states and 242 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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-03-08 22:46:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:43,201 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2025-03-08 22:46:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:46:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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 44 [2025-03-08 22:46:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:43,203 INFO L225 Difference]: With dead ends: 204 [2025-03-08 22:46:43,203 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 22:46:43,203 INFO L434 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-03-08 22:46:43,203 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 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-03-08 22:46:43,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 764 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 22:46:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 22:46:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 161 states have internal predecessors, (170), 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-03-08 22:46:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2025-03-08 22:46:43,211 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 44 [2025-03-08 22:46:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:43,211 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2025-03-08 22:46:43,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 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-03-08 22:46:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2025-03-08 22:46:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 22:46:43,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:43,214 INFO L218 NwaCegarLoop]: trace histogram [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-03-08 22:46:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:46:43,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1722566852, now seen corresponding path program 1 times [2025-03-08 22:46:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078036922] [2025-03-08 22:46:43,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:43,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 22:46:43,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 22:46:43,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:43,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:46:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078036922] [2025-03-08 22:46:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078036922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:43,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:43,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:46:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37834964] [2025-03-08 22:46:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:43,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:43,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:43,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:43,375 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-03-08 22:46:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:43,518 INFO L93 Difference]: Finished difference Result 202 states and 238 transitions. [2025-03-08 22:46:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 44 [2025-03-08 22:46:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:43,519 INFO L225 Difference]: With dead ends: 202 [2025-03-08 22:46:43,519 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 22:46:43,519 INFO L434 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-03-08 22:46:43,520 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 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-03-08 22:46:43,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 955 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 22:46:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-08 22:46:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 123 states have (on average 1.3658536585365855) internal successors, (168), 159 states have internal predecessors, (168), 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-03-08 22:46:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2025-03-08 22:46:43,530 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 44 [2025-03-08 22:46:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2025-03-08 22:46:43,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-03-08 22:46:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2025-03-08 22:46:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 22:46:43,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:43,531 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 22:46:43,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:46:43,532 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:43,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1859964745, now seen corresponding path program 1 times [2025-03-08 22:46:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:43,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780773263] [2025-03-08 22:46:43,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:43,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:43,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:46:43,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:46:43,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:43,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:43,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:43,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780773263] [2025-03-08 22:46:43,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780773263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:43,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865011343] [2025-03-08 22:46:43,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:43,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:43,723 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-03-08 22:46:43,725 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-03-08 22:46:43,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:46:43,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:46:43,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:43,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:43,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:46:43,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:43,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:43,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:46:43,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 22:46:43,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 22:46:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:46:43,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:43,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865011343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:43,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-08 22:46:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753145694] [2025-03-08 22:46:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:43,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:46:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:43,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:46:43,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:46:43,944 INFO L87 Difference]: Start difference. First operand 202 states and 238 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-03-08 22:46:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:44,168 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2025-03-08 22:46:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:46:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-08 22:46:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:44,169 INFO L225 Difference]: With dead ends: 206 [2025-03-08 22:46:44,169 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 22:46:44,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 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-03-08 22:46:44,171 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 10 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 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-03-08 22:46:44,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1262 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:46:44,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 22:46:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2025-03-08 22:46:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 158 states have internal predecessors, (167), 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-03-08 22:46:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 237 transitions. [2025-03-08 22:46:44,179 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 237 transitions. Word has length 45 [2025-03-08 22:46:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:44,179 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 237 transitions. [2025-03-08 22:46:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-03-08 22:46:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 237 transitions. [2025-03-08 22:46:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 22:46:44,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:44,180 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 22:46:44,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:46:44,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:46:44,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:44,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1859964744, now seen corresponding path program 1 times [2025-03-08 22:46:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247774987] [2025-03-08 22:46:44,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:44,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:46:44,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:46:44,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:44,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:44,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:44,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247774987] [2025-03-08 22:46:44,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247774987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:44,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763483107] [2025-03-08 22:46:44,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:44,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:44,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:44,554 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-03-08 22:46:44,555 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-03-08 22:46:44,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:46:44,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:46:44,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:44,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:44,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 22:46:44,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:44,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:44,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:44,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2025-03-08 22:46:44,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-08 22:46:44,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-03-08 22:46:44,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-03-08 22:46:44,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-08 22:46:44,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-08 22:46:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:46:44,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763483107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:44,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:44,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-03-08 22:46:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780745108] [2025-03-08 22:46:44,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:44,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:46:44,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:44,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:46:44,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:46:44,910 INFO L87 Difference]: Start difference. First operand 201 states and 237 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-03-08 22:46:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:45,261 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2025-03-08 22:46:45,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:46:45,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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 45 [2025-03-08 22:46:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:45,263 INFO L225 Difference]: With dead ends: 205 [2025-03-08 22:46:45,263 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 22:46:45,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 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-03-08 22:46:45,263 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 23 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:45,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1578 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 22:46:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-03-08 22:46:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 123 states have (on average 1.3495934959349594) internal successors, (166), 157 states have internal predecessors, (166), 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-03-08 22:46:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2025-03-08 22:46:45,269 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 45 [2025-03-08 22:46:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:45,270 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2025-03-08 22:46:45,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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-03-08 22:46:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2025-03-08 22:46:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:46:45,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:45,271 INFO L218 NwaCegarLoop]: trace histogram [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-03-08 22:46:45,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:46:45,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 22:46:45,475 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:45,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash -507269477, now seen corresponding path program 1 times [2025-03-08 22:46:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:45,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515870285] [2025-03-08 22:46:45,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:45,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:46:45,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:46:45,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:45,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515870285] [2025-03-08 22:46:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515870285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451656352] [2025-03-08 22:46:46,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:46,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:46,012 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-03-08 22:46:46,014 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-03-08 22:46:46,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:46:46,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:46:46,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:46,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:46,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:46:46,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:46,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:46,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2025-03-08 22:46:46,356 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-08 22:46:46,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2025-03-08 22:46:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:46,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:46:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451656352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:46:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 25 [2025-03-08 22:46:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301906149] [2025-03-08 22:46:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:46:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:46,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:46:46,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:46:46,452 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 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-03-08 22:46:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:47,562 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2025-03-08 22:46:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:46:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 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 52 [2025-03-08 22:46:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:47,567 INFO L225 Difference]: With dead ends: 253 [2025-03-08 22:46:47,567 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 22:46:47,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 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-03-08 22:46:47,568 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 638 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 427 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:47,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 876 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1272 Invalid, 23 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 22:46:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 22:46:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2025-03-08 22:46:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 142 states have (on average 1.352112676056338) internal successors, (192), 176 states have internal predecessors, (192), 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-03-08 22:46:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2025-03-08 22:46:47,576 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 52 [2025-03-08 22:46:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:47,576 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2025-03-08 22:46:47,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 13 states have internal predecessors, (46), 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-03-08 22:46:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2025-03-08 22:46:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 22:46:47,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:47,578 INFO L218 NwaCegarLoop]: trace histogram [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-03-08 22:46:47,584 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-03-08 22:46:47,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 22:46:47,782 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:47,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash -507269476, now seen corresponding path program 1 times [2025-03-08 22:46:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:47,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688200768] [2025-03-08 22:46:47,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:47,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:46:47,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:46:47,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:47,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:48,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:48,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688200768] [2025-03-08 22:46:48,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688200768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:48,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941692910] [2025-03-08 22:46:48,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:48,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:48,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:48,846 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-03-08 22:46:48,849 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-03-08 22:46:48,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 22:46:49,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 22:46:49,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:49,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:49,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 22:46:49,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:49,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-03-08 22:46:49,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:49,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:49,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:49,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-03-08 22:46:49,463 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-08 22:46:49,464 INFO L378 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 20 treesize of output 22 [2025-03-08 22:46:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:46:49,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941692910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:49,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:46:49,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2025-03-08 22:46:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657863842] [2025-03-08 22:46:49,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:49,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 22:46:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:49,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 22:46:49,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1652, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 22:46:49,888 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 37 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 30 states have internal predecessors, (90), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:46:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:52,018 INFO L93 Difference]: Finished difference Result 267 states and 323 transitions. [2025-03-08 22:46:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:46:52,019 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 30 states have internal predecessors, (90), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2025-03-08 22:46:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:52,020 INFO L225 Difference]: With dead ends: 267 [2025-03-08 22:46:52,020 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 22:46:52,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=315, Invalid=2877, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 22:46:52,021 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 208 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 97 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:52,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1552 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2485 Invalid, 11 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 22:46:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 22:46:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 233. [2025-03-08 22:46:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 181 states have internal predecessors, (195), 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-03-08 22:46:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2025-03-08 22:46:52,027 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 52 [2025-03-08 22:46:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:52,027 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2025-03-08 22:46:52,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 30 states have internal predecessors, (90), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 22:46:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2025-03-08 22:46:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 22:46:52,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:52,028 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-08 22:46:52,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:46:52,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:52,232 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash 80266030, now seen corresponding path program 1 times [2025-03-08 22:46:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084116885] [2025-03-08 22:46:52,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:52,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:46:52,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:46:52,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:52,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:46:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084116885] [2025-03-08 22:46:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084116885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:52,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:46:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433387932] [2025-03-08 22:46:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:46:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:52,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:46:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:46:52,393 INFO L87 Difference]: Start difference. First operand 233 states and 280 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 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-03-08 22:46:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:52,678 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2025-03-08 22:46:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:46:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 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 59 [2025-03-08 22:46:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:52,682 INFO L225 Difference]: With dead ends: 254 [2025-03-08 22:46:52,682 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 22:46:52,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:46:52,682 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 57 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:52,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1187 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 22:46:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2025-03-08 22:46:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 187 states have internal predecessors, (203), 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-03-08 22:46:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 290 transitions. [2025-03-08 22:46:52,690 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 290 transitions. Word has length 59 [2025-03-08 22:46:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:52,690 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 290 transitions. [2025-03-08 22:46:52,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 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-03-08 22:46:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 290 transitions. [2025-03-08 22:46:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 22:46:52,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:52,690 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-08 22:46:52,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:46:52,691 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:52,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:52,691 INFO L85 PathProgramCache]: Analyzing trace with hash 80266031, now seen corresponding path program 1 times [2025-03-08 22:46:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079036189] [2025-03-08 22:46:52,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:52,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:46:52,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:46:52,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:52,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:46:52,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:52,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079036189] [2025-03-08 22:46:52,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079036189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:46:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994366320] [2025-03-08 22:46:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:52,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:46:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:52,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:46:52,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:46:52,944 INFO L87 Difference]: Start difference. First operand 241 states and 290 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 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-03-08 22:46:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:53,256 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2025-03-08 22:46:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:46:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 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 59 [2025-03-08 22:46:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:53,257 INFO L225 Difference]: With dead ends: 255 [2025-03-08 22:46:53,257 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 22:46:53,257 INFO L434 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-03-08 22:46:53,257 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 58 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:53,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1386 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 22:46:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2025-03-08 22:46:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 187 states have internal predecessors, (202), 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-03-08 22:46:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 289 transitions. [2025-03-08 22:46:53,264 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 289 transitions. Word has length 59 [2025-03-08 22:46:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:53,265 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 289 transitions. [2025-03-08 22:46:53,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 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-03-08 22:46:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 289 transitions. [2025-03-08 22:46:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 22:46:53,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:53,265 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-08 22:46:53,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:46:53,266 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:53,266 INFO L85 PathProgramCache]: Analyzing trace with hash 455159894, now seen corresponding path program 1 times [2025-03-08 22:46:53,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:53,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912596441] [2025-03-08 22:46:53,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:53,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:46:53,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:46:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:53,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 22:46:53,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:53,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912596441] [2025-03-08 22:46:53,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912596441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:53,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400239675] [2025-03-08 22:46:53,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:53,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:53,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:53,404 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-03-08 22:46:53,407 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-03-08 22:46:53,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:46:53,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:46:53,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:53,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:53,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 22:46:53,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 22:46:53,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:53,634 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 22:46:53,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-08 22:46:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 22:46:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400239675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:53,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:53,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2025-03-08 22:46:53,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071817545] [2025-03-08 22:46:53,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:53,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:46:53,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:53,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:46:53,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:46:53,649 INFO L87 Difference]: Start difference. First operand 241 states and 289 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-03-08 22:46:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:54,007 INFO L93 Difference]: Finished difference Result 265 states and 317 transitions. [2025-03-08 22:46:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:46:54,007 INFO L78 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 69 [2025-03-08 22:46:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:54,008 INFO L225 Difference]: With dead ends: 265 [2025-03-08 22:46:54,008 INFO L226 Difference]: Without dead ends: 265 [2025-03-08 22:46:54,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 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-03-08 22:46:54,009 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 102 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:54,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1273 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:46:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-08 22:46:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 242. [2025-03-08 22:46:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 187 states have internal predecessors, (204), 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-03-08 22:46:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2025-03-08 22:46:54,014 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 69 [2025-03-08 22:46:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:54,014 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2025-03-08 22:46:54,014 INFO L472 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-03-08 22:46:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2025-03-08 22:46:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 22:46:54,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:54,016 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-08 22:46:54,024 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-03-08 22:46:54,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 22:46:54,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:54,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 455159895, now seen corresponding path program 1 times [2025-03-08 22:46:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259821733] [2025-03-08 22:46:54,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:54,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:46:54,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:46:54,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:54,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:46:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259821733] [2025-03-08 22:46:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259821733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801885535] [2025-03-08 22:46:54,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:46:54,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:54,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:54,524 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-03-08 22:46:54,526 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-03-08 22:46:54,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:46:54,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:46:54,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:46:54,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:54,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 22:46:54,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:54,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:54,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-08 22:46:55,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:46:55,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2025-03-08 22:46:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:46:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801885535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:46:55,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:46:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 38 [2025-03-08 22:46:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073642461] [2025-03-08 22:46:55,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:55,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 22:46:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:55,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 22:46:55,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 22:46:55,195 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand has 39 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 27 states have internal predecessors, (116), 12 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 22:46:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:56,271 INFO L93 Difference]: Finished difference Result 381 states and 468 transitions. [2025-03-08 22:46:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:46:56,274 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 27 states have internal predecessors, (116), 12 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) Word has length 69 [2025-03-08 22:46:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:56,275 INFO L225 Difference]: With dead ends: 381 [2025-03-08 22:46:56,275 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 22:46:56,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=1722, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 22:46:56,276 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 399 mSDsluCounter, 5753 mSDsCounter, 0 mSdLazyCounter, 2516 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 6055 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:56,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 6055 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2516 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 22:46:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 22:46:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 337. [2025-03-08 22:46:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 213 states have (on average 1.3943661971830985) internal successors, (297), 249 states have internal predecessors, (297), 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-03-08 22:46:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 449 transitions. [2025-03-08 22:46:56,286 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 449 transitions. Word has length 69 [2025-03-08 22:46:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:56,286 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 449 transitions. [2025-03-08 22:46:56,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 27 states have internal predecessors, (116), 12 states have call successors, (17), 10 states have call predecessors, (17), 6 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 22:46:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 449 transitions. [2025-03-08 22:46:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 22:46:56,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:56,287 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-08 22:46:56,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:46:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:56,489 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1373890836, now seen corresponding path program 2 times [2025-03-08 22:46:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347333056] [2025-03-08 22:46:56,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:46:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:56,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-08 22:46:56,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 76 statements. [2025-03-08 22:46:56,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:46:56,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 22:46:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347333056] [2025-03-08 22:46:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347333056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:46:56,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:46:56,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:46:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948262982] [2025-03-08 22:46:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:46:56,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:46:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:56,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:46:56,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:46:56,640 INFO L87 Difference]: Start difference. First operand 337 states and 449 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:46:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:46:56,787 INFO L93 Difference]: Finished difference Result 340 states and 452 transitions. [2025-03-08 22:46:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:46:56,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2025-03-08 22:46:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:46:56,788 INFO L225 Difference]: With dead ends: 340 [2025-03-08 22:46:56,788 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 22:46:56,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:46:56,789 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:46:56,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 980 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:46:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 22:46:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 339. [2025-03-08 22:46:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 215 states have (on average 1.3906976744186046) internal successors, (299), 251 states have internal predecessors, (299), 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-03-08 22:46:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 451 transitions. [2025-03-08 22:46:56,795 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 451 transitions. Word has length 76 [2025-03-08 22:46:56,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:46:56,795 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 451 transitions. [2025-03-08 22:46:56,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:46:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 451 transitions. [2025-03-08 22:46:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 22:46:56,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:46:56,796 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1] [2025-03-08 22:46:56,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:46:56,796 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:46:56,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:46:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1075260461, now seen corresponding path program 3 times [2025-03-08 22:46:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:46:56,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059899094] [2025-03-08 22:46:56,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:46:56,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-03-08 22:46:56,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-03-08 22:46:56,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:56,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 22:46:57,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:46:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059899094] [2025-03-08 22:46:57,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059899094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:57,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115238791] [2025-03-08 22:46:57,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:46:57,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:46:57,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:46:57,511 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-03-08 22:46:57,512 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-03-08 22:46:57,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-03-08 22:46:57,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-03-08 22:46:57,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:46:57,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:46:57,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-08 22:46:57,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:46:57,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:46:57,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:46:57,741 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:46:57,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-08 22:46:57,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:46:57,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:46:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:57,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-03-08 22:46:58,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:46:58,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-03-08 22:46:58,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:58,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:58,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:46:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-08 22:46:58,195 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-08 22:46:58,196 INFO L378 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 20 treesize of output 22 [2025-03-08 22:46:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 22:46:58,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:46:59,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115238791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:46:59,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:46:59,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 40 [2025-03-08 22:46:59,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673932966] [2025-03-08 22:46:59,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:46:59,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 22:46:59,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:46:59,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 22:46:59,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2110, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 22:46:59,011 INFO L87 Difference]: Start difference. First operand 339 states and 451 transitions. Second operand has 40 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 22:47:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:02,217 INFO L93 Difference]: Finished difference Result 381 states and 504 transitions. [2025-03-08 22:47:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 22:47:02,218 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 77 [2025-03-08 22:47:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:02,219 INFO L225 Difference]: With dead ends: 381 [2025-03-08 22:47:02,219 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 22:47:02,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=398, Invalid=5152, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 22:47:02,220 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 364 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 5164 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 5325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 5164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:02,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 2282 Invalid, 5325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 5164 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 22:47:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 22:47:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 342. [2025-03-08 22:47:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 218 states have (on average 1.371559633027523) internal successors, (299), 254 states have internal predecessors, (299), 74 states have call successors, (74), 18 states have call predecessors, (74), 20 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-03-08 22:47:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 451 transitions. [2025-03-08 22:47:02,227 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 451 transitions. Word has length 77 [2025-03-08 22:47:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:02,227 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 451 transitions. [2025-03-08 22:47:02,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 33 states have internal predecessors, (108), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 22:47:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 451 transitions. [2025-03-08 22:47:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 22:47:02,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:02,228 INFO L218 NwaCegarLoop]: trace histogram [3, 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-03-08 22:47:02,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:47:02,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 22:47:02,428 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:02,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -958372097, now seen corresponding path program 1 times [2025-03-08 22:47:02,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:02,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328716821] [2025-03-08 22:47:02,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:02,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 22:47:02,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 22:47:02,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:02,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 22:47:02,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328716821] [2025-03-08 22:47:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328716821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:02,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:47:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107190533] [2025-03-08 22:47:02,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:02,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:02,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:02,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:02,481 INFO L87 Difference]: Start difference. First operand 342 states and 451 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-03-08 22:47:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:02,486 INFO L93 Difference]: Finished difference Result 345 states and 451 transitions. [2025-03-08 22:47:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:02,486 INFO L78 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 77 [2025-03-08 22:47:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:02,488 INFO L225 Difference]: With dead ends: 345 [2025-03-08 22:47:02,488 INFO L226 Difference]: Without dead ends: 342 [2025-03-08 22:47:02,488 INFO L434 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-03-08 22:47:02,488 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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-03-08 22:47:02,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-08 22:47:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-08 22:47:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 218 states have (on average 1.3577981651376148) internal successors, (296), 254 states have internal predecessors, (296), 74 states have call successors, (74), 18 states have call predecessors, (74), 20 states have return successors, (78), 75 states have call predecessors, (78), 74 states have call successors, (78) [2025-03-08 22:47:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 448 transitions. [2025-03-08 22:47:02,494 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 448 transitions. Word has length 77 [2025-03-08 22:47:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:02,494 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 448 transitions. [2025-03-08 22:47:02,494 INFO L472 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-03-08 22:47:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 448 transitions. [2025-03-08 22:47:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 22:47:02,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:02,495 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1] [2025-03-08 22:47:02,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:47:02,495 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:02,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1818443373, now seen corresponding path program 1 times [2025-03-08 22:47:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:02,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197269556] [2025-03-08 22:47:02,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:02,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 22:47:02,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 22:47:02,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:02,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 22:47:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197269556] [2025-03-08 22:47:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197269556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231939043] [2025-03-08 22:47:02,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:02,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:02,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:02,681 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-03-08 22:47:02,683 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-03-08 22:47:02,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 22:47:02,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 22:47:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:02,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 22:47:02,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:02,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:47:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 22:47:03,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231939043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:47:03,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2025-03-08 22:47:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560080828] [2025-03-08 22:47:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:03,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:47:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:03,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:47:03,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:47:03,020 INFO L87 Difference]: Start difference. First operand 342 states and 448 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-03-08 22:47:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:03,149 INFO L93 Difference]: Finished difference Result 340 states and 438 transitions. [2025-03-08 22:47:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:47:03,149 INFO L78 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 84 [2025-03-08 22:47:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:03,150 INFO L225 Difference]: With dead ends: 340 [2025-03-08 22:47:03,150 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 22:47:03,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:47:03,151 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 55 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:03,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1030 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 22:47:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 329. [2025-03-08 22:47:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 209 states have (on average 1.3492822966507176) internal successors, (282), 244 states have internal predecessors, (282), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-08 22:47:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 426 transitions. [2025-03-08 22:47:03,160 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 426 transitions. Word has length 84 [2025-03-08 22:47:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:03,160 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 426 transitions. [2025-03-08 22:47:03,160 INFO L472 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-03-08 22:47:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 426 transitions. [2025-03-08 22:47:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 22:47:03,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:03,162 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:03,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 22:47:03,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 22:47:03,363 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:03,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:03,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2127748312, now seen corresponding path program 1 times [2025-03-08 22:47:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576207821] [2025-03-08 22:47:03,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:03,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 22:47:03,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 22:47:03,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:03,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 22:47:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576207821] [2025-03-08 22:47:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576207821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461589815] [2025-03-08 22:47:03,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:03,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:03,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:03,550 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-03-08 22:47:03,552 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-03-08 22:47:03,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 22:47:03,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 22:47:03,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:03,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:03,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 22:47:03,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:47:03,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:47:03,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 22:47:03,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 22:47:04,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 22:47:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 22:47:04,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:04,210 INFO L349 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2025-03-08 22:47:04,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-08 22:47:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 22:47:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461589815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:04,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:04,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 20 [2025-03-08 22:47:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085939632] [2025-03-08 22:47:04,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:04,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:47:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:04,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:47:04,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:47:04,219 INFO L87 Difference]: Start difference. First operand 329 states and 426 transitions. Second operand has 20 states, 20 states have (on average 4.9) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 22:47:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:05,147 INFO L93 Difference]: Finished difference Result 405 states and 541 transitions. [2025-03-08 22:47:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 22:47:05,148 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) Word has length 101 [2025-03-08 22:47:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:05,149 INFO L225 Difference]: With dead ends: 405 [2025-03-08 22:47:05,149 INFO L226 Difference]: Without dead ends: 399 [2025-03-08 22:47:05,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 180 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 22:47:05,150 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 144 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:05,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2520 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 22:47:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-08 22:47:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 330. [2025-03-08 22:47:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 210 states have (on average 1.3428571428571427) internal successors, (282), 245 states have internal predecessors, (282), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-08 22:47:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 426 transitions. [2025-03-08 22:47:05,156 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 426 transitions. Word has length 101 [2025-03-08 22:47:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:05,156 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 426 transitions. [2025-03-08 22:47:05,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.9) internal successors, (98), 17 states have internal predecessors, (98), 5 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 22:47:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 426 transitions. [2025-03-08 22:47:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 22:47:05,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:05,157 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:05,165 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-03-08 22:47:05,361 WARN L453 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-03-08 22:47:05,362 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFexgcdErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1375032582, now seen corresponding path program 1 times [2025-03-08 22:47:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:05,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758748843] [2025-03-08 22:47:05,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:05,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 22:47:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 22:47:05,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:05,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 22:47:05,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:05,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758748843] [2025-03-08 22:47:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758748843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:05,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830338767] [2025-03-08 22:47:05,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:05,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:05,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:05,601 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-03-08 22:47:05,603 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-03-08 22:47:05,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 22:47:05,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 22:47:05,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:05,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:05,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-08 22:47:05,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:05,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:47:05,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:47:05,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2025-03-08 22:47:05,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-03-08 22:47:05,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-03-08 22:47:05,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-03-08 22:47:06,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2025-03-08 22:47:06,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 26 [2025-03-08 22:47:06,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-08 22:47:06,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-03-08 22:47:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 22:47:06,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:07,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:47:07,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2025-03-08 22:47:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 22:47:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830338767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:07,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 38 [2025-03-08 22:47:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271520340] [2025-03-08 22:47:07,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:07,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 22:47:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:07,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 22:47:07,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 22:47:07,232 INFO L87 Difference]: Start difference. First operand 330 states and 426 transitions. Second operand has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 32 states have internal predecessors, (139), 8 states have call successors, (25), 7 states have call predecessors, (25), 5 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-08 22:47:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:08,780 INFO L93 Difference]: Finished difference Result 367 states and 479 transitions. [2025-03-08 22:47:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 22:47:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 32 states have internal predecessors, (139), 8 states have call successors, (25), 7 states have call predecessors, (25), 5 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) Word has length 102 [2025-03-08 22:47:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:08,781 INFO L225 Difference]: With dead ends: 367 [2025-03-08 22:47:08,781 INFO L226 Difference]: Without dead ends: 361 [2025-03-08 22:47:08,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 165 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=500, Invalid=3790, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 22:47:08,783 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 259 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:08,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 2414 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 22:47:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-08 22:47:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 331. [2025-03-08 22:47:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 211 states have (on average 1.3364928909952607) internal successors, (282), 246 states have internal predecessors, (282), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-08 22:47:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 426 transitions. [2025-03-08 22:47:08,789 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 426 transitions. Word has length 102 [2025-03-08 22:47:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:08,790 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 426 transitions. [2025-03-08 22:47:08,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 32 states have internal predecessors, (139), 8 states have call successors, (25), 7 states have call predecessors, (25), 5 states have return successors, (21), 8 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-08 22:47:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 426 transitions. [2025-03-08 22:47:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 22:47:08,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:08,791 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:08,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:08,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 22:47:08,991 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:08,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:08,992 INFO L85 PathProgramCache]: Analyzing trace with hash 256701787, now seen corresponding path program 1 times [2025-03-08 22:47:08,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:08,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835605527] [2025-03-08 22:47:08,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:08,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:09,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:47:09,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:47:09,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:09,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 22:47:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835605527] [2025-03-08 22:47:09,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835605527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726767887] [2025-03-08 22:47:09,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:09,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:09,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:09,266 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:09,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:47:09,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:47:09,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:47:09,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:09,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:47:09,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 22:47:09,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-08 22:47:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726767887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:09,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2025-03-08 22:47:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349315687] [2025-03-08 22:47:09,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:09,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:47:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:09,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:47:09,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:47:09,839 INFO L87 Difference]: Start difference. First operand 331 states and 426 transitions. Second operand has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 22:47:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:10,205 INFO L93 Difference]: Finished difference Result 357 states and 469 transitions. [2025-03-08 22:47:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:47:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2025-03-08 22:47:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:10,207 INFO L225 Difference]: With dead ends: 357 [2025-03-08 22:47:10,207 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 22:47:10,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=826, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 22:47:10,208 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 88 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:10,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1477 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 22:47:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2025-03-08 22:47:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 221 states have (on average 1.334841628959276) internal successors, (295), 256 states have internal predecessors, (295), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-08 22:47:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 439 transitions. [2025-03-08 22:47:10,220 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 439 transitions. Word has length 111 [2025-03-08 22:47:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:10,221 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 439 transitions. [2025-03-08 22:47:10,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.809523809523809) internal successors, (122), 21 states have internal predecessors, (122), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 22:47:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 439 transitions. [2025-03-08 22:47:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 22:47:10,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:10,223 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:10,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:10,424 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:10,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash 299210668, now seen corresponding path program 2 times [2025-03-08 22:47:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029222708] [2025-03-08 22:47:10,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:10,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-08 22:47:10,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 22:47:10,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 22:47:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029222708] [2025-03-08 22:47:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029222708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135364016] [2025-03-08 22:47:10,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:10,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:10,965 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:10,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:47:11,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-03-08 22:47:11,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 22:47:11,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:11,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:47:11,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 22:47:11,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-08 22:47:11,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135364016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:11,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:11,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 22 [2025-03-08 22:47:11,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876525099] [2025-03-08 22:47:11,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:11,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:47:11,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:11,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:47:11,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:47:11,437 INFO L87 Difference]: Start difference. First operand 341 states and 439 transitions. Second operand has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 22:47:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:11,993 INFO L93 Difference]: Finished difference Result 358 states and 464 transitions. [2025-03-08 22:47:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 22:47:11,993 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2025-03-08 22:47:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:11,994 INFO L225 Difference]: With dead ends: 358 [2025-03-08 22:47:11,994 INFO L226 Difference]: Without dead ends: 352 [2025-03-08 22:47:11,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 22:47:11,995 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 107 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:11,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1255 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-08 22:47:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 343. [2025-03-08 22:47:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 223 states have (on average 1.3228699551569507) internal successors, (295), 258 states have internal predecessors, (295), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-08 22:47:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 439 transitions. [2025-03-08 22:47:12,003 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 439 transitions. Word has length 116 [2025-03-08 22:47:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:12,003 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 439 transitions. [2025-03-08 22:47:12,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 22:47:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 439 transitions. [2025-03-08 22:47:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 22:47:12,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:12,004 INFO L218 NwaCegarLoop]: trace histogram [14, 6, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:12,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 22:47:12,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:12,205 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1629599596, now seen corresponding path program 3 times [2025-03-08 22:47:12,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:12,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76605650] [2025-03-08 22:47:12,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:47:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:12,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 120 statements into 6 equivalence classes. [2025-03-08 22:47:12,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 116 of 120 statements. [2025-03-08 22:47:12,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 22:47:12,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 77 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 22:47:12,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76605650] [2025-03-08 22:47:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76605650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369208248] [2025-03-08 22:47:12,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:47:12,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:12,631 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:12,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:47:12,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 120 statements into 6 equivalence classes. [2025-03-08 22:47:14,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 116 of 120 statements. [2025-03-08 22:47:14,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 22:47:14,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:14,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:47:14,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 77 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 22:47:14,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-08 22:47:15,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369208248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:15,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:15,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-03-08 22:47:15,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838157349] [2025-03-08 22:47:15,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:15,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 22:47:15,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:15,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 22:47:15,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:47:15,169 INFO L87 Difference]: Start difference. First operand 343 states and 439 transitions. Second operand has 30 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 22:47:28,092 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 46 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 22:47:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:41,105 INFO L93 Difference]: Finished difference Result 373 states and 491 transitions. [2025-03-08 22:47:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 22:47:41,106 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-03-08 22:47:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:41,107 INFO L225 Difference]: With dead ends: 373 [2025-03-08 22:47:41,107 INFO L226 Difference]: Without dead ends: 367 [2025-03-08 22:47:41,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=744, Invalid=2010, Unknown=2, NotChecked=0, Total=2756 [2025-03-08 22:47:41,108 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 163 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:41,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 2159 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-08 22:47:41,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2025-03-08 22:47:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 269 states have internal predecessors, (309), 70 states have call successors, (70), 18 states have call predecessors, (70), 20 states have return successors, (74), 72 states have call predecessors, (74), 70 states have call successors, (74) [2025-03-08 22:47:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 453 transitions. [2025-03-08 22:47:41,115 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 453 transitions. Word has length 120 [2025-03-08 22:47:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:41,115 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 453 transitions. [2025-03-08 22:47:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 22:47:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 453 transitions. [2025-03-08 22:47:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 22:47:41,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:41,117 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:41,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 22:47:41,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:41,318 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1413094644, now seen corresponding path program 4 times [2025-03-08 22:47:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:41,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851833627] [2025-03-08 22:47:41,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:47:41,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:41,343 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 126 statements into 2 equivalence classes. [2025-03-08 22:47:41,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:47:41,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 22:47:41,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:47:41,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:47:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:47:41,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:47:41,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:41,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:47:41,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:47:41,518 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:47:41,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2025-03-08 22:47:41,520 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2025-03-08 22:47:41,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2025-03-08 22:47:41,522 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location DUPFFexgcdErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2025-03-08 22:47:41,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2025-03-08 22:47:41,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2025-03-08 22:47:41,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:47:41,528 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:41,576 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:47:41,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:47:41 BoogieIcfgContainer [2025-03-08 22:47:41,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:47:41,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:47:41,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:47:41,582 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:47:41,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:46:36" (3/4) ... [2025-03-08 22:47:41,584 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 22:47:41,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:47:41,585 INFO L158 Benchmark]: Toolchain (without parser) took 65747.41ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.7MB in the beginning and 272.3MB in the end (delta: -168.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-08 22:47:41,585 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:47:41,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.50ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 73.6MB in the end (delta: 30.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 22:47:41,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.52ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:47:41,586 INFO L158 Benchmark]: Boogie Preprocessor took 54.62ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:47:41,587 INFO L158 Benchmark]: IcfgBuilder took 524.70ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 100.3MB in the end (delta: -33.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2025-03-08 22:47:41,587 INFO L158 Benchmark]: TraceAbstraction took 64616.52ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 99.6MB in the beginning and 272.4MB in the end (delta: -172.8MB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. [2025-03-08 22:47:41,587 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 327.2MB. Free memory was 272.4MB in the beginning and 272.3MB in the end (delta: 41.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:47:41,587 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.50ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 73.6MB in the end (delta: 30.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.52ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 70.8MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.62ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 524.70ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 100.3MB in the end (delta: -33.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * TraceAbstraction took 64616.52ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 99.6MB in the beginning and 272.4MB in the end (delta: -172.8MB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 327.2MB. Free memory was 272.4MB in the beginning and 272.3MB in the end (delta: 41.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 964]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 964. Possible FailurePath: [L966] DUPFF f, g, cf, cg, h; VAL [cf={14:0}, cg={15:0}] [L967] CALL, EXPR DUPFFnew(1) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=1, ans={-2:0}, maxdeg=1] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=1, ans={-2:0}, maxdeg=1] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=1, ans={-2:0}, maxdeg=1] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=1, ans={-2:0}] [L901] ans->deg = -1 VAL [\old(maxdeg)=1, ans={-2:0}] [L902] return ans; VAL [\old(maxdeg)=1, \result={-2:0}] [L967] RET, EXPR DUPFFnew(1) VAL [cf={14:0}, cg={15:0}] [L967] f = DUPFFnew(1) [L967] EXPR f->coeffs [L967] f->coeffs[1] = 1 [L967] f->deg = 1 [L968] CALL, EXPR DUPFFnew(2) [L894] DUPFF ans = (DUPFF)malloc(sizeof(struct DUPFFstruct)); [L895] ans->coeffs = 0 VAL [\old(maxdeg)=2, ans={-4:0}, maxdeg=2] [L896] COND TRUE maxdeg >= 0 [L897] ans->coeffs = (FFelem*)malloc((maxdeg+1)*sizeof(FFelem)) VAL [\old(maxdeg)=2, ans={-4:0}, maxdeg=2] [L898] EXPR ans->coeffs VAL [\old(maxdeg)=2, ans={-4:0}, maxdeg=2] [L898] FCALL memset(ans->coeffs, 0, (maxdeg+1)*sizeof(FFelem)) [L900] ans->maxdeg = maxdeg VAL [\old(maxdeg)=2, ans={-4:0}] [L901] ans->deg = -1 VAL [\old(maxdeg)=2, ans={-4:0}] [L902] return ans; VAL [\old(maxdeg)=2, \result={-4:0}] [L968] RET, EXPR DUPFFnew(2) VAL [cf={14:0}, cg={15:0}, f={-2:0}] [L968] g = DUPFFnew(2) [L968] EXPR g->coeffs [L968] g->coeffs[2] = 1 [L968] g->deg = 2 [L969] CALL, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [\old(f)={-2:0}] [L890] EXPR f->deg VAL [\old(f)={-2:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [\old(f)={-4:0}] [L890] EXPR f->deg VAL [\old(f)={-4:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] COND TRUE DUPFFdeg(f) < DUPFFdeg(g) [L922] CALL, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}] [L919] DUPFF u, v, uf, ug, vf, vg; [L920] FFelem q, lcu, lcvrecip, p; [L921] int df, dg, du, dv; VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] CALL, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}] [L890] EXPR f->deg VAL [\old(f)={-4:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] CALL, EXPR DUPFFdeg(g) VAL [\old(f)={-2:0}] [L890] EXPR f->deg VAL [\old(f)={-2:0}] [L890] return f->deg; [L922] RET, EXPR DUPFFdeg(g) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] COND FALSE !(DUPFFdeg(f) < DUPFFdeg(g)) [L923] CALL, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}] [L890] EXPR f->deg VAL [\old(f)={-4:0}] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(f) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] CALL, EXPR DUPFFdeg(g) VAL [\old(f)={-2:0}] [L890] EXPR f->deg VAL [\old(f)={-2:0}] [L890] return f->deg; [L923] RET, EXPR DUPFFdeg(g) VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1 VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L923] COND FALSE !(DUPFFdeg(f) != 2 || DUPFFdeg(g) != 1) [L924] EXPR f->coeffs VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L924] EXPR f->coeffs[0] VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, f={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L924] COND TRUE f->coeffs[0] == 0 [L924] return f; VAL [\old(f)={-4:0}, \old(fcofac)={15:0}, \old(g)={-2:0}, \old(gcofac)={14:0}, \result={-4:0}, fcofac={15:0}, g={-2:0}, gcofac={14:0}] [L922] RET, EXPR DUPFFexgcd(gcofac, fcofac, g, f) VAL [\old(f)={-2:0}, \old(fcofac)={14:0}, \old(g)={-4:0}, \old(gcofac)={15:0}, f={-2:0}, fcofac={14:0}, g={-4:0}, gcofac={15:0}] [L922] return DUPFFexgcd(gcofac, fcofac, g, f); [L969] RET, EXPR DUPFFexgcd(&cf, &cg, f, g) VAL [cf={14:0}, cg={15:0}, f={-2:0}, g={-4:0}] [L969] h = DUPFFexgcd(&cf, &cg, f, g) [L970] h = h [L971] return 0; [L971] return 0; [L971] return 0; VAL [\result=0, f={-2:0}, g={-4:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 192 locations, 266 edges, 55 error locations. Started 1 CEGAR loops. OverallTime: 64.5s, OverallIterations: 32, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 41.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 mSolverCounterUnknown, 2920 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2887 mSDsluCounter, 42338 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36292 mSDsCounter, 1237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22345 IncrementalHoareTripleChecker+Invalid, 23616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1237 mSolverCounterUnsat, 6046 mSDtfsCounter, 22345 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2309 GetRequests, 1650 SyntacticMatches, 33 SemanticMatches, 626 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5482 ImplicationChecksByTransitivity, 34.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=31, InterpolantAutomatonStates: 410, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 363 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 2873 NumberOfCodeBlocks, 2802 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 3381 ConstructedInterpolants, 129 QuantifiedInterpolants, 18476 SizeOfPredicates, 119 NumberOfNonLiveVariables, 9085 ConjunctsInSsa, 661 ConjunctsInUnsatCore, 54 InterpolantComputations, 22 PerfectInterpolantSequences, 2522/2866 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 22:47:41,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 ../sv-benchmarks/c/memsafety/20020406-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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-?-e2fb8be-m [2025-03-08 22:47:43,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:47:43,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-08 22:47:43,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:47:43,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:47:43,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:47:43,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:47:43,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:47:43,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:47:43,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:47:43,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:47:43,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:47:43,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:47:43,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:47:43,387 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:47:43,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:47:43,388 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 22:47:43,389 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 22:47:43,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:47:43,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:47:43,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:47:43,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:47:43,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:47:43,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:47:43,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:47:43,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:47:43,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:43,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:47:43,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:47:43,391 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 22:47:43,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 22:47:43,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:47:43,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:47:43,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:47:43,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:47:43,391 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-03-08 22:47:43,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:47:43,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:47:43,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:47:43,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:47:43,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:47:43,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2025-03-08 22:47:44,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2ac5660/92f40e7a68014bf2b063a917c3f2f449/FLAG7f0984d47 [2025-03-08 22:47:44,960 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:47:44,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2025-03-08 22:47:44,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2ac5660/92f40e7a68014bf2b063a917c3f2f449/FLAG7f0984d47 [2025-03-08 22:47:45,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2ac5660/92f40e7a68014bf2b063a917c3f2f449 [2025-03-08 22:47:45,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:47:45,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:47:45,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:45,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:47:45,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:47:45,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1c71f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45, skipping insertion in model container [2025-03-08 22:47:45,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:47:45,559 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:47:45,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:45,596 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:47:45,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:45,697 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:47:45,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45 WrapperNode [2025-03-08 22:47:45,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:45,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:45,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:47:45,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:47:45,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,743 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-03-08 22:47:45,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:45,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:47:45,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:47:45,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:47:45,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,783 INFO L175 MemorySlicer]: Split 30 memory accesses to 4 slices as follows [2, 2, 9, 17]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0]. The 16 writes are split as follows [2, 0, 6, 8]. [2025-03-08 22:47:45,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:47:45,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:47:45,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:47:45,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:47:45,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (1/1) ... [2025-03-08 22:47:45,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:45,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:45,861 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-03-08 22:47:45,864 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-03-08 22:47:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2025-03-08 22:47:45,881 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2025-03-08 22:47:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 22:47:45,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2025-03-08 22:47:45,882 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2025-03-08 22:47:45,882 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2025-03-08 22:47:45,882 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2025-03-08 22:47:45,882 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 22:47:45,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 22:47:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2025-03-08 22:47:45,884 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2025-03-08 22:47:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2025-03-08 22:47:45,884 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2025-03-08 22:47:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:47:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:47:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:47:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:47:45,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:47:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 22:47:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2025-03-08 22:47:45,885 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2025-03-08 22:47:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2025-03-08 22:47:45,885 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2025-03-08 22:47:45,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:47:45,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:47:46,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:47:46,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:47:46,047 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L890: havoc #t~mem31; [2025-03-08 22:47:46,385 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L966: call ULTIMATE.dealloc(main_~#cf~0#1.base, main_~#cf~0#1.offset);havoc main_~#cf~0#1.base, main_~#cf~0#1.offset;call ULTIMATE.dealloc(main_~#cg~0#1.base, main_~#cg~0#1.offset);havoc main_~#cg~0#1.base, main_~#cg~0#1.offset; [2025-03-08 22:47:46,432 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-03-08 22:47:46,432 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:47:46,442 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:47:46,444 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:47:46,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:46 BoogieIcfgContainer [2025-03-08 22:47:46,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:47:46,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:47:46,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:47:46,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:47:46,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:47:45" (1/3) ... [2025-03-08 22:47:46,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e65e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:46, skipping insertion in model container [2025-03-08 22:47:46,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:45" (2/3) ... [2025-03-08 22:47:46,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e65e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:46, skipping insertion in model container [2025-03-08 22:47:46,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:46" (3/3) ... [2025-03-08 22:47:46,452 INFO L128 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2025-03-08 22:47:46,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:47:46,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 20020406-1.i that has 9 procedures, 187 locations, 1 initial locations, 3 loop locations, and 55 error locations. [2025-03-08 22:47:46,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:47:46,496 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20b156c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:47:46,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-03-08 22:47:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 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-03-08 22:47:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:47:46,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:46,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:47:46,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:46,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash 211890118, now seen corresponding path program 1 times [2025-03-08 22:47:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548032633] [2025-03-08 22:47:46,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:46,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:46,514 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-03-08 22:47:46,515 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-03-08 22:47:46,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:47:46,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:47:46,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:46,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:46,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:47:46,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:46,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:47:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:46,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:46,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548032633] [2025-03-08 22:47:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548032633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318823883] [2025-03-08 22:47:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:46,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:46,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:46,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:46,664 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 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-03-08 22:47:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:46,855 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-08 22:47:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:46,856 INFO L78 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-03-08 22:47:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:46,862 INFO L225 Difference]: With dead ends: 182 [2025-03-08 22:47:46,863 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 22:47:46,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-08 22:47:46,867 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 15 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 351 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:46,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 351 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 22:47:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-08 22:47:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) 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-03-08 22:47:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-03-08 22:47:46,913 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2025-03-08 22:47:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:46,913 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-03-08 22:47:46,913 INFO L472 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-03-08 22:47:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-03-08 22:47:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:47:46,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:46,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:47:46,921 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-03-08 22:47:47,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:47,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:47,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:47,119 INFO L85 PathProgramCache]: Analyzing trace with hash 211890119, now seen corresponding path program 1 times [2025-03-08 22:47:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:47,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116575357] [2025-03-08 22:47:47,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:47,123 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-03-08 22:47:47,124 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-03-08 22:47:47,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:47:47,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:47:47,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:47,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:47,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:47:47,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:47,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:47:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:47,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:47,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:47,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116575357] [2025-03-08 22:47:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116575357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:47,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:47,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228160078] [2025-03-08 22:47:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:47,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:47,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:47,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:47,211 INFO L87 Difference]: Start difference. First operand 180 states and 216 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-03-08 22:47:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:47,397 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-03-08 22:47:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:47,397 INFO L78 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-03-08 22:47:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:47,398 INFO L225 Difference]: With dead ends: 182 [2025-03-08 22:47:47,398 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 22:47:47,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-08 22:47:47,399 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 366 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:47,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 366 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 22:47:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2025-03-08 22:47:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 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-03-08 22:47:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2025-03-08 22:47:47,412 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2025-03-08 22:47:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:47,412 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2025-03-08 22:47:47,412 INFO L472 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-03-08 22:47:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2025-03-08 22:47:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:47:47,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:47,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:47,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:47:47,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:47,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:47,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1762940516, now seen corresponding path program 1 times [2025-03-08 22:47:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409605948] [2025-03-08 22:47:47,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:47,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:47,615 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-03-08 22:47:47,616 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-03-08 22:47:47,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:47:47,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:47:47,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:47,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:47:47,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:47,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:47:47,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:47:47,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 22:47:47,771 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 22:47:47,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-08 22:47:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:47,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:47,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409605948] [2025-03-08 22:47:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409605948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:47,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:47,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:47:47,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223408282] [2025-03-08 22:47:47,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:47,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:47,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:47,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:47,781 INFO L87 Difference]: Start difference. First operand 181 states and 217 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-03-08 22:47:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:48,013 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2025-03-08 22:47:48,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:48,013 INFO L78 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-03-08 22:47:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:48,015 INFO L225 Difference]: With dead ends: 177 [2025-03-08 22:47:48,016 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 22:47:48,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-08 22:47:48,017 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 14 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 475 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:48,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 475 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 22:47:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2025-03-08 22:47:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 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-03-08 22:47:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2025-03-08 22:47:48,030 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2025-03-08 22:47:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:48,031 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2025-03-08 22:47:48,031 INFO L472 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-03-08 22:47:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2025-03-08 22:47:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:47:48,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:48,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:48,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:47:48,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:48,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:48,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2140473250, now seen corresponding path program 1 times [2025-03-08 22:47:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443420021] [2025-03-08 22:47:48,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:48,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:48,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:48,235 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-03-08 22:47:48,237 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-03-08 22:47:48,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:47:48,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:47:48,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:48,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:48,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:47:48,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:48,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 22:47:48,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:47:48,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:47:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:48,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:48,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443420021] [2025-03-08 22:47:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443420021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:47:48,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733401112] [2025-03-08 22:47:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:48,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:48,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:48,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:48,380 INFO L87 Difference]: Start difference. First operand 175 states and 211 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-03-08 22:47:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:48,710 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2025-03-08 22:47:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:48,711 INFO L78 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-03-08 22:47:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:48,712 INFO L225 Difference]: With dead ends: 177 [2025-03-08 22:47:48,712 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 22:47:48,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-03-08 22:47:48,713 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 12 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 801 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:48,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 801 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 22:47:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2025-03-08 22:47:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 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-03-08 22:47:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2025-03-08 22:47:48,728 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2025-03-08 22:47:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:48,729 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2025-03-08 22:47:48,729 INFO L472 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-03-08 22:47:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2025-03-08 22:47:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:47:48,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:48,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:48,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:47:48,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:48,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:48,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1930161321, now seen corresponding path program 1 times [2025-03-08 22:47:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:48,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867550223] [2025-03-08 22:47:48,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:48,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:48,936 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-03-08 22:47:48,937 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-03-08 22:47:48,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:47:49,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:47:49,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:49,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:49,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:47:49,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:49,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:47:49,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:47:49,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:47:49,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 22:47:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:49,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:49,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867550223] [2025-03-08 22:47:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867550223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:49,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:49,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:47:49,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656364219] [2025-03-08 22:47:49,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:49,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:47:49,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:49,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:47:49,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:47:49,165 INFO L87 Difference]: Start difference. First operand 174 states and 210 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-03-08 22:47:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:49,452 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2025-03-08 22:47:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:47:49,454 INFO L78 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-03-08 22:47:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:49,455 INFO L225 Difference]: With dead ends: 190 [2025-03-08 22:47:49,455 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 22:47:49,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-03-08 22:47:49,455 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:49,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 758 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 22:47:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-08 22:47:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 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-03-08 22:47:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2025-03-08 22:47:49,464 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2025-03-08 22:47:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:49,464 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2025-03-08 22:47:49,464 INFO L472 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-03-08 22:47:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2025-03-08 22:47:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:47:49,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:49,465 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-03-08 22:47:49,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:47:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:49,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:49,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -170589798, now seen corresponding path program 1 times [2025-03-08 22:47:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:49,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293110196] [2025-03-08 22:47:49,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:49,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:49,671 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-03-08 22:47:49,672 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-03-08 22:47:49,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:47:49,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:47:49,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:49,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:49,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:47:49,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:49,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:49,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293110196] [2025-03-08 22:47:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293110196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:47:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974187745] [2025-03-08 22:47:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:49,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:49,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:49,790 INFO L87 Difference]: Start difference. First operand 190 states and 226 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-03-08 22:47:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:50,061 INFO L93 Difference]: Finished difference Result 188 states and 224 transitions. [2025-03-08 22:47:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:50,061 INFO L78 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-03-08 22:47:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:50,062 INFO L225 Difference]: With dead ends: 188 [2025-03-08 22:47:50,062 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 22:47:50,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-03-08 22:47:50,063 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 10 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 758 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:50,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 758 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 22:47:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-08 22:47:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 102 states have (on average 1.5098039215686274) internal successors, (154), 146 states have internal predecessors, (154), 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-03-08 22:47:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2025-03-08 22:47:50,072 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 21 [2025-03-08 22:47:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:50,072 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2025-03-08 22:47:50,072 INFO L472 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-03-08 22:47:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2025-03-08 22:47:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:47:50,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:50,073 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-03-08 22:47:50,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:47:50,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:50,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:50,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -170589797, now seen corresponding path program 1 times [2025-03-08 22:47:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:50,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762733633] [2025-03-08 22:47:50,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:50,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:50,280 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-03-08 22:47:50,281 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-03-08 22:47:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:47:50,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:47:50,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:50,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:50,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:47:50,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:50,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:50,412 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762733633] [2025-03-08 22:47:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762733633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:50,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:47:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150217790] [2025-03-08 22:47:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:50,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:50,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:50,414 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 6 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-03-08 22:47:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:50,512 INFO L93 Difference]: Finished difference Result 202 states and 242 transitions. [2025-03-08 22:47:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:47:50,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 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-03-08 22:47:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:50,514 INFO L225 Difference]: With dead ends: 202 [2025-03-08 22:47:50,514 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 22:47:50,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:47:50,515 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:50,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 772 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 22:47:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-08 22:47:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 154 states have internal predecessors, (162), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-03-08 22:47:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 236 transitions. [2025-03-08 22:47:50,520 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 236 transitions. Word has length 21 [2025-03-08 22:47:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:50,521 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 236 transitions. [2025-03-08 22:47:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-03-08 22:47:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 236 transitions. [2025-03-08 22:47:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:47:50,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:50,521 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-03-08 22:47:50,528 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-03-08 22:47:50,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:50,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:50,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash -819685610, now seen corresponding path program 1 times [2025-03-08 22:47:50,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:50,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203697286] [2025-03-08 22:47:50,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:50,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:50,728 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-03-08 22:47:50,729 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-03-08 22:47:50,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:47:50,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:47:50,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:50,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:50,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:47:50,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:50,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:51,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203697286] [2025-03-08 22:47:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203697286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:51,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:47:51,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 22:47:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547810187] [2025-03-08 22:47:51,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:51,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:47:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:51,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:47:51,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:47:51,024 INFO L87 Difference]: Start difference. First operand 196 states and 236 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:47:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:51,383 INFO L93 Difference]: Finished difference Result 239 states and 293 transitions. [2025-03-08 22:47:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:47:51,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 22:47:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:51,386 INFO L225 Difference]: With dead ends: 239 [2025-03-08 22:47:51,386 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 22:47:51,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:47:51,386 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 81 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:51,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1160 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 22:47:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 214. [2025-03-08 22:47:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 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-03-08 22:47:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2025-03-08 22:47:51,396 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 22 [2025-03-08 22:47:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:51,396 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2025-03-08 22:47:51,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:47:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2025-03-08 22:47:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:47:51,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:51,397 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:51,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:47:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:51,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1748236197, now seen corresponding path program 2 times [2025-03-08 22:47:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848039422] [2025-03-08 22:47:51,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:51,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:51,600 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-03-08 22:47:51,601 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-03-08 22:47:51,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 22:47:51,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-08 22:47:51,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:47:51,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:51,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:47:51,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:47:51,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:51,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:51,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848039422] [2025-03-08 22:47:51,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848039422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:51,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:51,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:47:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030763910] [2025-03-08 22:47:51,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:51,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:47:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:51,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:47:51,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:47:51,775 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03-08 22:47:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:52,101 INFO L93 Difference]: Finished difference Result 212 states and 260 transitions. [2025-03-08 22:47:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:47:52,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 25 [2025-03-08 22:47:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:52,104 INFO L225 Difference]: With dead ends: 212 [2025-03-08 22:47:52,104 INFO L226 Difference]: Without dead ends: 212 [2025-03-08 22:47:52,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-03-08 22:47:52,104 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 9 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 950 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:52,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 950 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-08 22:47:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-08 22:47:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 127 states have (on average 1.4645669291338583) internal successors, (186), 169 states have internal predecessors, (186), 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-03-08 22:47:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 260 transitions. [2025-03-08 22:47:52,115 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 260 transitions. Word has length 25 [2025-03-08 22:47:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:52,115 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 260 transitions. [2025-03-08 22:47:52,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-03-08 22:47:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 260 transitions. [2025-03-08 22:47:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:47:52,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:52,116 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:52,123 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-03-08 22:47:52,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:52,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1639252863, now seen corresponding path program 1 times [2025-03-08 22:47:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077184280] [2025-03-08 22:47:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:52,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:52,319 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-03-08 22:47:52,320 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-03-08 22:47:52,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:47:52,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:47:52,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:52,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:52,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:47:52,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:52,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:52,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077184280] [2025-03-08 22:47:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077184280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:52,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:47:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-08 22:47:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881033561] [2025-03-08 22:47:52,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:52,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:47:52,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:52,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:47:52,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:47:52,819 INFO L87 Difference]: Start difference. First operand 212 states and 260 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:47:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:53,653 INFO L93 Difference]: Finished difference Result 258 states and 323 transitions. [2025-03-08 22:47:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 22:47:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 22:47:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:53,655 INFO L225 Difference]: With dead ends: 258 [2025-03-08 22:47:53,655 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 22:47:53,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 22:47:53,655 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 70 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:53,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1879 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:47:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 22:47:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2025-03-08 22:47:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 136 states have (on average 1.4558823529411764) internal successors, (198), 178 states have internal predecessors, (198), 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-03-08 22:47:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 272 transitions. [2025-03-08 22:47:53,663 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 272 transitions. Word has length 26 [2025-03-08 22:47:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:53,663 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 272 transitions. [2025-03-08 22:47:53,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:47:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 272 transitions. [2025-03-08 22:47:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:47:53,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:53,664 INFO L218 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:53,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:47:53,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:53,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:53,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash -422300481, now seen corresponding path program 2 times [2025-03-08 22:47:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:53,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463444416] [2025-03-08 22:47:53,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:53,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:53,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:53,867 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-03-08 22:47:53,868 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-03-08 22:47:53,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 22:47:53,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 30 statements. [2025-03-08 22:47:53,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:47:53,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:53,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:47:53,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:53,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:47:54,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:47:54,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:47:54,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:47:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 22:47:54,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:54,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463444416] [2025-03-08 22:47:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463444416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:47:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800429564] [2025-03-08 22:47:54,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:54,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:47:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:54,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:47:54,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:47:54,101 INFO L87 Difference]: Start difference. First operand 221 states and 272 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-03-08 22:47:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:54,469 INFO L93 Difference]: Finished difference Result 225 states and 280 transitions. [2025-03-08 22:47:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:47:54,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 30 [2025-03-08 22:47:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:54,471 INFO L225 Difference]: With dead ends: 225 [2025-03-08 22:47:54,471 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 22:47:54,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:47:54,472 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 12 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:54,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1104 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 22:47:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 220. [2025-03-08 22:47:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 136 states have (on average 1.4485294117647058) internal successors, (197), 177 states have internal predecessors, (197), 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-03-08 22:47:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions. [2025-03-08 22:47:54,477 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 30 [2025-03-08 22:47:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:54,478 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 271 transitions. [2025-03-08 22:47:54,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-03-08 22:47:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2025-03-08 22:47:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:47:54,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:54,478 INFO L218 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:54,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:54,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:54,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:54,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash -422300480, now seen corresponding path program 1 times [2025-03-08 22:47:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:54,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355841609] [2025-03-08 22:47:54,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:54,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:54,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:54,682 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-03-08 22:47:54,683 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-03-08 22:47:54,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:47:54,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:47:54,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:54,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:54,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 22:47:54,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:54,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-08 22:47:54,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:47:54,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:47:54,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-08 22:47:54,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:47:54,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-08 22:47:55,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:47:55,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 22:47:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 22:47:55,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:55,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355841609] [2025-03-08 22:47:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355841609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:55,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:55,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:47:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699325916] [2025-03-08 22:47:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:55,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:47:55,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:55,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:47:55,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:47:55,110 INFO L87 Difference]: Start difference. First operand 220 states and 271 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-03-08 22:47:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:55,699 INFO L93 Difference]: Finished difference Result 224 states and 279 transitions. [2025-03-08 22:47:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:47:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 30 [2025-03-08 22:47:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:55,700 INFO L225 Difference]: With dead ends: 224 [2025-03-08 22:47:55,700 INFO L226 Difference]: Without dead ends: 224 [2025-03-08 22:47:55,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:47:55,701 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 16 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:55,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1232 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:47:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-08 22:47:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2025-03-08 22:47:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 176 states have internal predecessors, (196), 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-03-08 22:47:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 270 transitions. [2025-03-08 22:47:55,706 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 270 transitions. Word has length 30 [2025-03-08 22:47:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:55,706 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 270 transitions. [2025-03-08 22:47:55,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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-03-08 22:47:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 270 transitions. [2025-03-08 22:47:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 22:47:55,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:55,707 INFO L218 NwaCegarLoop]: trace histogram [8, 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-03-08 22:47:55,714 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-03-08 22:47:55,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:55,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1503288212, now seen corresponding path program 1 times [2025-03-08 22:47:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:55,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1659738976] [2025-03-08 22:47:55,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:55,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:55,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:55,910 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-03-08 22:47:55,911 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-03-08 22:47:55,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:47:56,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:47:56,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:47:56,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:56,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:47:56,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:47:56,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:47:56,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 22:47:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 22:47:56,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:56,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659738976] [2025-03-08 22:47:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659738976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:56,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:56,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:47:56,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109230165] [2025-03-08 22:47:56,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:56,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:47:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:47:56,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:47:56,122 INFO L87 Difference]: Start difference. First operand 219 states and 270 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-03-08 22:47:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:56,368 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2025-03-08 22:47:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:47:56,369 INFO L78 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 42 [2025-03-08 22:47:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:56,369 INFO L225 Difference]: With dead ends: 231 [2025-03-08 22:47:56,369 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 22:47:56,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 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-03-08 22:47:56,370 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 31 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:56,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 759 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 22:47:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2025-03-08 22:47:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 132 states have (on average 1.393939393939394) internal successors, (184), 172 states have internal predecessors, (184), 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-03-08 22:47:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 254 transitions. [2025-03-08 22:47:56,375 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 254 transitions. Word has length 42 [2025-03-08 22:47:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:56,375 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 254 transitions. [2025-03-08 22:47:56,375 INFO L472 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-03-08 22:47:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 254 transitions. [2025-03-08 22:47:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 22:47:56,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:56,376 INFO L218 NwaCegarLoop]: trace histogram [10, 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-03-08 22:47:56,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 22:47:56,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:56,577 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:56,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash -617035876, now seen corresponding path program 1 times [2025-03-08 22:47:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:56,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62777793] [2025-03-08 22:47:56,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:56,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:56,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:56,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:47:56,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:47:56,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:47:56,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:47:56,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 22:47:56,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 22:47:56,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:56,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62777793] [2025-03-08 22:47:56,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62777793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:56,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:47:56,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 22:47:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960274687] [2025-03-08 22:47:56,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:56,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:47:56,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:56,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:47:56,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:47:56,904 INFO L87 Difference]: Start difference. First operand 215 states and 254 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:47:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:57,260 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2025-03-08 22:47:57,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:47:57,261 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-08 22:47:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:57,262 INFO L225 Difference]: With dead ends: 234 [2025-03-08 22:47:57,262 INFO L226 Difference]: Without dead ends: 228 [2025-03-08 22:47:57,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:47:57,263 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 75 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:57,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1473 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-08 22:47:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2025-03-08 22:47:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 176 states have internal predecessors, (188), 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-03-08 22:47:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 258 transitions. [2025-03-08 22:47:57,270 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 258 transitions. Word has length 53 [2025-03-08 22:47:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:57,270 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 258 transitions. [2025-03-08 22:47:57,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:47:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2025-03-08 22:47:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 22:47:57,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:57,272 INFO L218 NwaCegarLoop]: trace histogram [14, 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-03-08 22:47:57,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:57,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:57,473 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:57,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2027590876, now seen corresponding path program 2 times [2025-03-08 22:47:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:57,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141213767] [2025-03-08 22:47:57,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:57,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:57,475 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:57,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:47:57,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-08 22:47:57,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 57 statements. [2025-03-08 22:47:57,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:47:57,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:57,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:47:57,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 22:47:57,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:57,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141213767] [2025-03-08 22:47:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141213767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:47:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376497387] [2025-03-08 22:47:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:47:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:57,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:47:57,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:47:57,669 INFO L87 Difference]: Start difference. First operand 219 states and 258 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-03-08 22:47:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:57,939 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2025-03-08 22:47:57,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:47:57,939 INFO L78 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 57 [2025-03-08 22:47:57,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:57,940 INFO L225 Difference]: With dead ends: 217 [2025-03-08 22:47:57,940 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 22:47:57,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 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-03-08 22:47:57,940 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 11 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:57,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 789 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:57,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 22:47:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-08 22:47:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 174 states have internal predecessors, (186), 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-03-08 22:47:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2025-03-08 22:47:57,945 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 57 [2025-03-08 22:47:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:57,946 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2025-03-08 22:47:57,946 INFO L472 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-03-08 22:47:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2025-03-08 22:47:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 22:47:57,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:57,946 INFO L218 NwaCegarLoop]: trace histogram [14, 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-03-08 22:47:57,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 22:47:58,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,147 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:58,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2027590875, now seen corresponding path program 1 times [2025-03-08 22:47:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435158615] [2025-03-08 22:47:58,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:58,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:58,150 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:58,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:47:58,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:47:58,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:47:58,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:58,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:58,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:47:58,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 22:47:58,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:58,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435158615] [2025-03-08 22:47:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435158615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:58,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:47:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532089373] [2025-03-08 22:47:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:58,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:58,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:58,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:58,353 INFO L87 Difference]: Start difference. First operand 217 states and 256 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-03-08 22:47:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:58,583 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2025-03-08 22:47:58,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:58,583 INFO L78 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 57 [2025-03-08 22:47:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:58,584 INFO L225 Difference]: With dead ends: 215 [2025-03-08 22:47:58,584 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 22:47:58,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 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-03-08 22:47:58,585 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 9 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:58,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 739 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:47:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 22:47:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-08 22:47:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 172 states have internal predecessors, (184), 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-03-08 22:47:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 254 transitions. [2025-03-08 22:47:58,589 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 254 transitions. Word has length 57 [2025-03-08 22:47:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:58,589 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 254 transitions. [2025-03-08 22:47:58,589 INFO L472 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-03-08 22:47:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 254 transitions. [2025-03-08 22:47:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 22:47:58,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:58,591 INFO L218 NwaCegarLoop]: trace histogram [14, 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-03-08 22:47:58,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 22:47:58,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:58,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1569192174, now seen corresponding path program 1 times [2025-03-08 22:47:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404005701] [2025-03-08 22:47:58,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:58,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:58,794 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:58,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 22:47:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:47:58,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:47:58,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:58,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:58,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:47:58,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:58,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:47:59,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:47:59,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 22:47:59,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 22:47:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 22:47:59,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:47:59,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:47:59,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404005701] [2025-03-08 22:47:59,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404005701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:59,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:59,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:47:59,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100626008] [2025-03-08 22:47:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:59,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:47:59,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:47:59,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:47:59,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:47:59,069 INFO L87 Difference]: Start difference. First operand 215 states and 254 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-03-08 22:47:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:59,434 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2025-03-08 22:47:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:47:59,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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 58 [2025-03-08 22:47:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:59,435 INFO L225 Difference]: With dead ends: 219 [2025-03-08 22:47:59,435 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 22:47:59,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:47:59,435 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 12 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:59,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1235 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:47:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 22:47:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2025-03-08 22:47:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 171 states have internal predecessors, (183), 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-03-08 22:47:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2025-03-08 22:47:59,440 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 58 [2025-03-08 22:47:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:59,441 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2025-03-08 22:47:59,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-03-08 22:47:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2025-03-08 22:47:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 22:47:59,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:59,441 INFO L218 NwaCegarLoop]: trace histogram [14, 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-03-08 22:47:59,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 22:47:59,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:59,642 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:47:59,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1569192173, now seen corresponding path program 1 times [2025-03-08 22:47:59,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:47:59,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78933533] [2025-03-08 22:47:59,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:59,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:59,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:59,644 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:59,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 22:47:59,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:47:59,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:47:59,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:59,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 22:47:59,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:59,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-08 22:47:59,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:47:59,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:47:59,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-08 22:47:59,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:47:59,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-08 22:47:59,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:48:00,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 22:48:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 22:48:00,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:00,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78933533] [2025-03-08 22:48:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78933533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:48:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944332342] [2025-03-08 22:48:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:00,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:48:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:00,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:48:00,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:48:00,051 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-03-08 22:48:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:00,592 INFO L93 Difference]: Finished difference Result 218 states and 260 transitions. [2025-03-08 22:48:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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 58 [2025-03-08 22:48:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:00,593 INFO L225 Difference]: With dead ends: 218 [2025-03-08 22:48:00,594 INFO L226 Difference]: Without dead ends: 218 [2025-03-08 22:48:00,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:48:00,594 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 16 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:00,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1191 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:48:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-08 22:48:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2025-03-08 22:48:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 136 states have (on average 1.338235294117647) internal successors, (182), 170 states have internal predecessors, (182), 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-03-08 22:48:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 252 transitions. [2025-03-08 22:48:00,598 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 252 transitions. Word has length 58 [2025-03-08 22:48:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 252 transitions. [2025-03-08 22:48:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 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-03-08 22:48:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 252 transitions. [2025-03-08 22:48:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 22:48:00,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:00,599 INFO L218 NwaCegarLoop]: trace histogram [14, 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-03-08 22:48:00,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:00,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:00,800 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-03-08 22:48:00,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2127766949, now seen corresponding path program 1 times [2025-03-08 22:48:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:48:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729957143] [2025-03-08 22:48:00,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:00,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:00,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:00,802 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:00,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 22:48:00,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:48:00,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:48:00,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:00,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:00,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:48:00,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 77 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 22:48:01,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 22:48:01,312 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:48:01,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729957143] [2025-03-08 22:48:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729957143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:01,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-08 22:48:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724043983] [2025-03-08 22:48:01,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:01,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:48:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:48:01,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:48:01,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:01,313 INFO L87 Difference]: Start difference. First operand 213 states and 252 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)