./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/20020406-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/memsafety/20020406-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41163ad2e246060aaa46c0cf36ebe60f4f883df830ad951a8fd3cafb3042cabf --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:23:49,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:23:49,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:23:50,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:23:50,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:23:50,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:23:50,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:23:50,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:23:50,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:23:50,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:23:50,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:23:50,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:23:50,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:23:50,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:23:50,024 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:23:50,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:23:50,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:23:50,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:23:50,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:23:50,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:23:50,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:23:50,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:50,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:50,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:50,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:50,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:50,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:23:50,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:23:50,027 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 -> 41163ad2e246060aaa46c0cf36ebe60f4f883df830ad951a8fd3cafb3042cabf [2025-04-29 11:23:50,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:23:50,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:23:50,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:23:50,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:23:50,271 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:23:50,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20020406-1.c [2025-04-29 11:23:51,605 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a6f9eceb/5c63eb68f6b64bc78c36824ca1d400e7/FLAG45d43b1a7 [2025-04-29 11:23:51,822 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:23:51,823 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/20020406-1.c [2025-04-29 11:23:51,831 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:51,832 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:51,832 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:51,832 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:23:51,840 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a6f9eceb/5c63eb68f6b64bc78c36824ca1d400e7/FLAG45d43b1a7 [2025-04-29 11:23:52,606 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a6f9eceb/5c63eb68f6b64bc78c36824ca1d400e7 [2025-04-29 11:23:52,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:23:52,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:23:52,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:23:52,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:23:52,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:23:52,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d04c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52, skipping insertion in model container [2025-04-29 11:23:52,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:23:52,769 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:23:52,803 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:23:52,816 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:23:52,855 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:23:52,869 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:23:52,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52 WrapperNode [2025-04-29 11:23:52,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:23:52,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:23:52,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:23:52,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:23:52,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,902 INFO L138 Inliner]: procedures = 21, calls = 72, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2025-04-29 11:23:52,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:23:52,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:23:52,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:23:52,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:23:52,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,941 INFO L175 MemorySlicer]: Split 28 memory accesses to 3 slices as follows [2, 9, 17]. 61 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 16 writes are split as follows [2, 6, 8]. [2025-04-29 11:23:52,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:23:52,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:23:52,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:23:52,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:23:52,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (1/1) ... [2025-04-29 11:23:52,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:52,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:52,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:23:52,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:23:53,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:23:53,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:23:53,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:23:53,005 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2025-04-29 11:23:53,005 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2025-04-29 11:23:53,005 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2025-04-29 11:23:53,005 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2025-04-29 11:23:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2025-04-29 11:23:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2025-04-29 11:23:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2025-04-29 11:23:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2025-04-29 11:23:53,006 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2025-04-29 11:23:53,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:23:53,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:23:53,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:23:53,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:23:53,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:23:53,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:23:53,007 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2025-04-29 11:23:53,007 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2025-04-29 11:23:53,080 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:23:53,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:23:53,461 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-04-29 11:23:53,461 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:23:53,472 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:23:53,472 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:23:53,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:53 BoogieIcfgContainer [2025-04-29 11:23:53,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:23:53,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:23:53,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:23:53,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:23:53,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:23:52" (1/3) ... [2025-04-29 11:23:53,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdbd5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:53, skipping insertion in model container [2025-04-29 11:23:53,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:23:52" (2/3) ... [2025-04-29 11:23:53,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdbd5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:23:53, skipping insertion in model container [2025-04-29 11:23:53,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:23:53" (3/3) ... [2025-04-29 11:23:53,481 INFO L128 eAbstractionObserver]: Analyzing ICFG 20020406-1.c [2025-04-29 11:23:53,492 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:23:53,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 20020406-1.c that has 9 procedures, 192 locations, 266 edges, 1 initial locations, 3 loop locations, and 55 error locations. [2025-04-29 11:23:53,531 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:23:53,539 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e13f769, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:23:53,540 INFO L341 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2025-04-29 11:23:53,544 INFO L278 IsEmpty]: Start isEmpty. Operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:53,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:23:53,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:53,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:23:53,548 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:53,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash 232998296, now seen corresponding path program 1 times [2025-04-29 11:23:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:53,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132924633] [2025-04-29 11:23:53,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:53,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:23:53,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:23:53,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:53,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:53,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132924633] [2025-04-29 11:23:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132924633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:53,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:53,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050536275] [2025-04-29 11:23:53,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:53,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:53,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:53,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:53,844 INFO L87 Difference]: Start difference. First operand has 192 states, 95 states have (on average 1.694736842105263) internal successors, (161), 151 states have internal predecessors, (161), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:53,964 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-04-29 11:23:53,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:53,965 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:23:53,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:53,971 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:23:53,971 INFO L226 Difference]: Without dead ends: 185 [2025-04-29 11:23:53,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:53,975 INFO L437 NwaCegarLoop]: 208 mSDtfsCounter, 15 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:53,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-29 11:23:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-04-29 11:23:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 92 states have (on average 1.641304347826087) internal successors, (151), 144 states have internal predecessors, (151), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2025-04-29 11:23:54,012 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 5 [2025-04-29 11:23:54,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:54,012 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2025-04-29 11:23:54,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,012 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2025-04-29 11:23:54,013 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:23:54,013 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:54,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:23:54,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:23:54,013 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:54,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 232998297, now seen corresponding path program 1 times [2025-04-29 11:23:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:54,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778753844] [2025-04-29 11:23:54,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:54,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:23:54,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:23:54,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:54,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:54,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:54,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778753844] [2025-04-29 11:23:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778753844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:54,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:23:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143208018] [2025-04-29 11:23:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:54,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:23:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:54,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:23:54,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:54,079 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:54,166 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2025-04-29 11:23:54,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:54,166 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:23:54,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:54,172 INFO L225 Difference]: With dead ends: 187 [2025-04-29 11:23:54,172 INFO L226 Difference]: Without dead ends: 187 [2025-04-29 11:23:54,172 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:23:54,172 INFO L437 NwaCegarLoop]: 215 mSDtfsCounter, 4 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:54,172 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 377 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:54,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-29 11:23:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2025-04-29 11:23:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 145 states have internal predecessors, (152), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2025-04-29 11:23:54,187 INFO L79 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 5 [2025-04-29 11:23:54,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:54,187 INFO L485 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2025-04-29 11:23:54,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,187 INFO L278 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2025-04-29 11:23:54,189 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:23:54,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:54,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:54,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:23:54,190 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:54,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash 573062298, now seen corresponding path program 1 times [2025-04-29 11:23:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:54,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112162449] [2025-04-29 11:23:54,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:54,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:23:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:23:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:54,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112162449] [2025-04-29 11:23:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112162449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:54,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:23:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269158434] [2025-04-29 11:23:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:54,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:54,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:54,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:54,306 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:54,422 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-04-29 11:23:54,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:23:54,422 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:23:54,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:54,423 INFO L225 Difference]: With dead ends: 182 [2025-04-29 11:23:54,424 INFO L226 Difference]: Without dead ends: 182 [2025-04-29 11:23:54,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:54,424 INFO L437 NwaCegarLoop]: 205 mSDtfsCounter, 14 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:54,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 491 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-29 11:23:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-04-29 11:23:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-04-29 11:23:54,437 INFO L79 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 7 [2025-04-29 11:23:54,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:54,437 INFO L485 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-04-29 11:23:54,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,439 INFO L278 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-04-29 11:23:54,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:23:54,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:54,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:54,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:23:54,439 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:54,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 604825434, now seen corresponding path program 1 times [2025-04-29 11:23:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:54,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747773076] [2025-04-29 11:23:54,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:23:54,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:23:54,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:54,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:54,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747773076] [2025-04-29 11:23:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747773076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:54,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938230164] [2025-04-29 11:23:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:54,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:54,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:54,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:54,586 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:54,763 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2025-04-29 11:23:54,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:54,763 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:23:54,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:54,764 INFO L225 Difference]: With dead ends: 182 [2025-04-29 11:23:54,764 INFO L226 Difference]: Without dead ends: 182 [2025-04-29 11:23:54,764 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:54,765 INFO L437 NwaCegarLoop]: 207 mSDtfsCounter, 12 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:54,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 826 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-29 11:23:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2025-04-29 11:23:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 92 states have (on average 1.576086956521739) internal successors, (145), 138 states have internal predecessors, (145), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 215 transitions. [2025-04-29 11:23:54,777 INFO L79 Accepts]: Start accepts. Automaton has 179 states and 215 transitions. Word has length 11 [2025-04-29 11:23:54,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:54,777 INFO L485 AbstractCegarLoop]: Abstraction has 179 states and 215 transitions. [2025-04-29 11:23:54,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:54,777 INFO L278 IsEmpty]: Start isEmpty. Operand 179 states and 215 transitions. [2025-04-29 11:23:54,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:23:54,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:54,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:54,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:23:54,778 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:54,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1569719318, now seen corresponding path program 1 times [2025-04-29 11:23:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:54,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258114470] [2025-04-29 11:23:54,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:54,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:23:54,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:23:54,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:54,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:54,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258114470] [2025-04-29 11:23:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258114470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:54,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:54,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:23:54,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208820650] [2025-04-29 11:23:54,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:54,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:54,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:54,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:54,996 INFO L87 Difference]: Start difference. First operand 179 states and 215 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:55,257 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-04-29 11:23:55,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:23:55,258 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-29 11:23:55,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:55,259 INFO L225 Difference]: With dead ends: 195 [2025-04-29 11:23:55,261 INFO L226 Difference]: Without dead ends: 195 [2025-04-29 11:23:55,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:23:55,261 INFO L437 NwaCegarLoop]: 204 mSDtfsCounter, 25 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:55,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1248 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-29 11:23:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-04-29 11:23:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 107 states have (on average 1.5046728971962617) internal successors, (161), 153 states have internal predecessors, (161), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2025-04-29 11:23:55,274 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 12 [2025-04-29 11:23:55,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:55,274 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2025-04-29 11:23:55,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:23:55,274 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2025-04-29 11:23:55,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:23:55,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:55,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:55,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:23:55,275 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:55,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash -579710849, now seen corresponding path program 1 times [2025-04-29 11:23:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:55,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511812520] [2025-04-29 11:23:55,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:55,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:23:55,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:23:55,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:55,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:55,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511812520] [2025-04-29 11:23:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511812520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:55,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113854016] [2025-04-29 11:23:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:55,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:55,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:55,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:55,386 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:55,546 INFO L93 Difference]: Finished difference Result 193 states and 229 transitions. [2025-04-29 11:23:55,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:55,547 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-04-29 11:23:55,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:55,548 INFO L225 Difference]: With dead ends: 193 [2025-04-29 11:23:55,549 INFO L226 Difference]: Without dead ends: 193 [2025-04-29 11:23:55,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:55,549 INFO L437 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:55,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 783 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-29 11:23:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-29 11:23:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 107 states have (on average 1.485981308411215) internal successors, (159), 151 states have internal predecessors, (159), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 229 transitions. [2025-04-29 11:23:55,559 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 229 transitions. Word has length 21 [2025-04-29 11:23:55,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:55,559 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 229 transitions. [2025-04-29 11:23:55,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:55,559 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 229 transitions. [2025-04-29 11:23:55,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:23:55,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:55,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:55,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:23:55,560 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:55,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash -579710848, now seen corresponding path program 1 times [2025-04-29 11:23:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:55,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864145639] [2025-04-29 11:23:55,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:55,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:23:55,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:23:55,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:55,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:55,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864145639] [2025-04-29 11:23:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864145639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:55,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:55,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:23:55,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867067054] [2025-04-29 11:23:55,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:55,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:23:55,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:55,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:23:55,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:55,722 INFO L87 Difference]: Start difference. First operand 193 states and 229 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:55,882 INFO L93 Difference]: Finished difference Result 191 states and 227 transitions. [2025-04-29 11:23:55,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:55,883 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-04-29 11:23:55,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:55,885 INFO L225 Difference]: With dead ends: 191 [2025-04-29 11:23:55,885 INFO L226 Difference]: Without dead ends: 191 [2025-04-29 11:23:55,885 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:55,886 INFO L437 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:55,886 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 984 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-29 11:23:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-04-29 11:23:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 149 states have internal predecessors, (157), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-04-29 11:23:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2025-04-29 11:23:55,893 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 21 [2025-04-29 11:23:55,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:55,893 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2025-04-29 11:23:55,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:55,893 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2025-04-29 11:23:55,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:23:55,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:55,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:55,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:23:55,894 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:55,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:55,895 INFO L85 PathProgramCache]: Analyzing trace with hash -791166942, now seen corresponding path program 1 times [2025-04-29 11:23:55,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:55,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931517057] [2025-04-29 11:23:55,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:55,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:23:55,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:23:55,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:56,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:56,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931517057] [2025-04-29 11:23:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931517057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:56,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:23:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294987952] [2025-04-29 11:23:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:56,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:23:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:56,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:23:56,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:56,123 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:56,222 INFO L93 Difference]: Finished difference Result 217 states and 260 transitions. [2025-04-29 11:23:56,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:23:56,223 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-04-29 11:23:56,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:56,224 INFO L225 Difference]: With dead ends: 217 [2025-04-29 11:23:56,224 INFO L226 Difference]: Without dead ends: 211 [2025-04-29 11:23:56,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:23:56,225 INFO L437 NwaCegarLoop]: 206 mSDtfsCounter, 18 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:56,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-29 11:23:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2025-04-29 11:23:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.435483870967742) internal successors, (178), 166 states have internal predecessors, (178), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-04-29 11:23:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2025-04-29 11:23:56,232 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 22 [2025-04-29 11:23:56,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:56,233 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2025-04-29 11:23:56,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:56,233 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2025-04-29 11:23:56,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:23:56,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:56,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:56,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:23:56,234 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:56,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:56,234 INFO L85 PathProgramCache]: Analyzing trace with hash -7118614, now seen corresponding path program 1 times [2025-04-29 11:23:56,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:56,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973224069] [2025-04-29 11:23:56,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:56,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:56,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:56,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:56,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:56,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:56,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:56,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973224069] [2025-04-29 11:23:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973224069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:56,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370920126] [2025-04-29 11:23:56,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:56,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:56,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:56,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:56,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:23:56,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:56,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:56,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:56,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:56,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 11:23:56,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:56,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:23:56,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:56,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:56,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2025-04-29 11:23:56,767 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-04-29 11:23:56,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-04-29 11:23:56,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-04-29 11:23:56,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-04-29 11:23:56,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-29 11:23:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:23:56,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:56,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370920126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:56,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:23:56,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-04-29 11:23:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783255072] [2025-04-29 11:23:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:56,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:23:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:56,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:23:56,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:23:56,874 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:57,210 INFO L93 Difference]: Finished difference Result 213 states and 260 transitions. [2025-04-29 11:23:57,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:23:57,210 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-04-29 11:23:57,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:57,212 INFO L225 Difference]: With dead ends: 213 [2025-04-29 11:23:57,213 INFO L226 Difference]: Without dead ends: 213 [2025-04-29 11:23:57,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:23:57,213 INFO L437 NwaCegarLoop]: 190 mSDtfsCounter, 23 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:57,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1281 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:23:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-04-29 11:23:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2025-04-29 11:23:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 165 states have internal predecessors, (177), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-04-29 11:23:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2025-04-29 11:23:57,223 INFO L79 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 23 [2025-04-29 11:23:57,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:57,224 INFO L485 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2025-04-29 11:23:57,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:57,224 INFO L278 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2025-04-29 11:23:57,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:23:57,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:57,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:57,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:57,429 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:57,429 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:57,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -7118615, now seen corresponding path program 1 times [2025-04-29 11:23:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:57,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236773050] [2025-04-29 11:23:57,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:57,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:57,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:57,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:57,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:57,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236773050] [2025-04-29 11:23:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236773050] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:57,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634962281] [2025-04-29 11:23:57,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:57,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:57,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:57,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:57,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:23:57,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:23:57,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:23:57,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:57,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:57,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:23:57,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:57,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:23:57,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:57,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:23:57,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-29 11:23:57,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-29 11:23:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:23:57,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634962281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:23:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2025-04-29 11:23:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963060243] [2025-04-29 11:23:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:57,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:23:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:57,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:23:57,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:23:57,835 INFO L87 Difference]: Start difference. First operand 208 states and 251 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-04-29 11:23:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:58,054 INFO L93 Difference]: Finished difference Result 212 states and 259 transitions. [2025-04-29 11:23:58,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:23:58,054 INFO L79 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 23 [2025-04-29 11:23:58,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:58,055 INFO L225 Difference]: With dead ends: 212 [2025-04-29 11:23:58,055 INFO L226 Difference]: Without dead ends: 212 [2025-04-29 11:23:58,056 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:23:58,056 INFO L437 NwaCegarLoop]: 198 mSDtfsCounter, 4 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:58,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1083 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:23:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-04-29 11:23:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2025-04-29 11:23:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 164 states have internal predecessors, (176), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2025-04-29 11:23:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2025-04-29 11:23:58,064 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 23 [2025-04-29 11:23:58,064 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:58,064 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2025-04-29 11:23:58,064 INFO L486 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-04-29 11:23:58,064 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2025-04-29 11:23:58,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 11:23:58,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:58,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:58,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:58,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:23:58,265 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:58,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 24263514, now seen corresponding path program 1 times [2025-04-29 11:23:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:58,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046457623] [2025-04-29 11:23:58,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:58,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:23:58,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:23:58,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:23:58,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:58,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046457623] [2025-04-29 11:23:58,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046457623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:23:58,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591321755] [2025-04-29 11:23:58,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:58,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:58,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:23:58,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:23:58,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:23:58,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:23:58,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:23:58,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:58,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:58,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-29 11:23:58,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:23:58,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:23:58,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:23:58,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:23:58,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:23:58,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:23:58,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:23:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591321755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:58,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:23:58,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2025-04-29 11:23:58,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691738309] [2025-04-29 11:23:58,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:58,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:23:58,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:58,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:23:58,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:23:58,794 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-04-29 11:23:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:58,972 INFO L93 Difference]: Finished difference Result 215 states and 256 transitions. [2025-04-29 11:23:58,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:23:58,973 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-04-29 11:23:58,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:58,974 INFO L225 Difference]: With dead ends: 215 [2025-04-29 11:23:58,974 INFO L226 Difference]: Without dead ends: 215 [2025-04-29 11:23:58,974 INFO L436 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-04-29 11:23:58,975 INFO L437 NwaCegarLoop]: 196 mSDtfsCounter, 34 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:58,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 751 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-29 11:23:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2025-04-29 11:23:58,985 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-04-29 11:23:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 243 transitions. [2025-04-29 11:23:58,986 INFO L79 Accepts]: Start accepts. Automaton has 206 states and 243 transitions. Word has length 35 [2025-04-29 11:23:58,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:58,986 INFO L485 AbstractCegarLoop]: Abstraction has 206 states and 243 transitions. [2025-04-29 11:23:58,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 11:23:58,986 INFO L278 IsEmpty]: Start isEmpty. Operand 206 states and 243 transitions. [2025-04-29 11:23:58,987 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 11:23:58,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:58,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:23:58,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:23:59,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:23:59,188 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:59,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash 59577649, now seen corresponding path program 1 times [2025-04-29 11:23:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:59,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137029296] [2025-04-29 11:23:59,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:59,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:23:59,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:23:59,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:59,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137029296] [2025-04-29 11:23:59,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137029296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:59,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:59,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:23:59,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555209381] [2025-04-29 11:23:59,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:59,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:23:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:59,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:23:59,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:23:59,245 INFO L87 Difference]: Start difference. First operand 206 states and 243 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:23:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:59,286 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2025-04-29 11:23:59,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:23:59,287 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-04-29 11:23:59,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:59,288 INFO L225 Difference]: With dead ends: 216 [2025-04-29 11:23:59,288 INFO L226 Difference]: Without dead ends: 211 [2025-04-29 11:23:59,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:23:59,288 INFO L437 NwaCegarLoop]: 204 mSDtfsCounter, 12 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:59,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 585 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:23:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-29 11:23:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2025-04-29 11:23:59,293 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-04-29 11:23:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 242 transitions. [2025-04-29 11:23:59,294 INFO L79 Accepts]: Start accepts. Automaton has 206 states and 242 transitions. Word has length 36 [2025-04-29 11:23:59,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:59,294 INFO L485 AbstractCegarLoop]: Abstraction has 206 states and 242 transitions. [2025-04-29 11:23:59,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-29 11:23:59,294 INFO L278 IsEmpty]: Start isEmpty. Operand 206 states and 242 transitions. [2025-04-29 11:23:59,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:23:59,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:59,295 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-04-29 11:23:59,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:23:59,295 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:59,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 580914877, now seen corresponding path program 1 times [2025-04-29 11:23:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:59,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530760585] [2025-04-29 11:23:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:59,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:23:59,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:23:59,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:59,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:23:59,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:59,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530760585] [2025-04-29 11:23:59,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530760585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:59,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:59,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:23:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217853135] [2025-04-29 11:23:59,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:59,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:23:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:59,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:23:59,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:59,387 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-04-29 11:23:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:59,517 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2025-04-29 11:23:59,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:23:59,518 INFO L79 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-04-29 11:23:59,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:59,519 INFO L225 Difference]: With dead ends: 204 [2025-04-29 11:23:59,519 INFO L226 Difference]: Without dead ends: 204 [2025-04-29 11:23:59,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:23:59,519 INFO L437 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-04-29 11:23:59,520 INFO L438 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-04-29 11:23:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-04-29 11:23:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-04-29 11:23:59,524 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-04-29 11:23:59,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2025-04-29 11:23:59,525 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 44 [2025-04-29 11:23:59,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:59,525 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2025-04-29 11:23:59,525 INFO L486 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-04-29 11:23:59,525 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2025-04-29 11:23:59,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-29 11:23:59,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:59,526 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-04-29 11:23:59,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:23:59,526 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:59,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash 580914878, now seen corresponding path program 1 times [2025-04-29 11:23:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:59,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268702399] [2025-04-29 11:23:59,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:23:59,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:23:59,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:59,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:23:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:23:59,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:23:59,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268702399] [2025-04-29 11:23:59,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268702399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:23:59,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:23:59,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:23:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689327245] [2025-04-29 11:23:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:23:59,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:23:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:23:59,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:23:59,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:59,699 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-04-29 11:23:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:23:59,838 INFO L93 Difference]: Finished difference Result 202 states and 238 transitions. [2025-04-29 11:23:59,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:23:59,839 INFO L79 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-04-29 11:23:59,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:23:59,840 INFO L225 Difference]: With dead ends: 202 [2025-04-29 11:23:59,840 INFO L226 Difference]: Without dead ends: 202 [2025-04-29 11:23:59,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:23:59,840 INFO L437 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:23:59,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 959 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:23:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-29 11:23:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-04-29 11:23:59,844 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-04-29 11:23:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 238 transitions. [2025-04-29 11:23:59,845 INFO L79 Accepts]: Start accepts. Automaton has 202 states and 238 transitions. Word has length 44 [2025-04-29 11:23:59,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:23:59,845 INFO L485 AbstractCegarLoop]: Abstraction has 202 states and 238 transitions. [2025-04-29 11:23:59,846 INFO L486 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-04-29 11:23:59,846 INFO L278 IsEmpty]: Start isEmpty. Operand 202 states and 238 transitions. [2025-04-29 11:23:59,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:23:59,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:23:59,846 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-04-29 11:23:59,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:23:59,846 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:23:59,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:23:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 828492207, now seen corresponding path program 1 times [2025-04-29 11:23:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:23:59,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071856804] [2025-04-29 11:23:59,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:23:59,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:23:59,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:23:59,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:23:59,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:23:59,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:00,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071856804] [2025-04-29 11:24:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071856804] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:00,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278571751] [2025-04-29 11:24:00,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:00,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:00,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:00,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:00,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:24:00,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:24:00,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:24:00,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:00,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:00,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:24:00,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:00,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:24:00,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:24:00,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-29 11:24:00,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-29 11:24:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:24:00,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:00,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278571751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:00,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:24:00,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-04-29 11:24:00,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421103854] [2025-04-29 11:24:00,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:00,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:24:00,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:00,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:24:00,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:24:00,238 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-04-29 11:24:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:00,460 INFO L93 Difference]: Finished difference Result 206 states and 245 transitions. [2025-04-29 11:24:00,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:24:00,460 INFO L79 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-04-29 11:24:00,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:00,461 INFO L225 Difference]: With dead ends: 206 [2025-04-29 11:24:00,461 INFO L226 Difference]: Without dead ends: 206 [2025-04-29 11:24:00,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:24:00,461 INFO L437 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-04-29 11:24:00,462 INFO L438 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-04-29 11:24:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-04-29 11:24:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2025-04-29 11:24:00,469 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-04-29 11:24:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 237 transitions. [2025-04-29 11:24:00,471 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 237 transitions. Word has length 45 [2025-04-29 11:24:00,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:00,471 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 237 transitions. [2025-04-29 11:24:00,471 INFO L486 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-04-29 11:24:00,471 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 237 transitions. [2025-04-29 11:24:00,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:24:00,472 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:00,472 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-04-29 11:24:00,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:00,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:24:00,673 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:00,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash 828492208, now seen corresponding path program 1 times [2025-04-29 11:24:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:00,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574804271] [2025-04-29 11:24:00,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:00,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:24:00,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:24:00,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:00,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:00,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574804271] [2025-04-29 11:24:00,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574804271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:00,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031597835] [2025-04-29 11:24:00,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:00,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:00,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:00,878 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:00,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:24:00,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:24:00,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:24:00,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:00,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:00,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-29 11:24:01,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:01,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:24:01,031 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:24:01,034 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:24:01,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2025-04-29 11:24:01,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-04-29 11:24:01,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-04-29 11:24:01,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-04-29 11:24:01,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-04-29 11:24:01,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-29 11:24:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:24:01,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031597835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:01,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:24:01,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2025-04-29 11:24:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636391403] [2025-04-29 11:24:01,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:01,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:24:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:01,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:24:01,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:24:01,202 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-04-29 11:24:01,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:01,545 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2025-04-29 11:24:01,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:24:01,545 INFO L79 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-04-29 11:24:01,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:01,546 INFO L225 Difference]: With dead ends: 205 [2025-04-29 11:24:01,546 INFO L226 Difference]: Without dead ends: 205 [2025-04-29 11:24:01,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:24:01,547 INFO L437 NwaCegarLoop]: 184 mSDtfsCounter, 23 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:01,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1583 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:24:01,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-29 11:24:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-04-29 11:24:01,551 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-04-29 11:24:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 236 transitions. [2025-04-29 11:24:01,552 INFO L79 Accepts]: Start accepts. Automaton has 200 states and 236 transitions. Word has length 45 [2025-04-29 11:24:01,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:01,552 INFO L485 AbstractCegarLoop]: Abstraction has 200 states and 236 transitions. [2025-04-29 11:24:01,552 INFO L486 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-04-29 11:24:01,552 INFO L278 IsEmpty]: Start isEmpty. Operand 200 states and 236 transitions. [2025-04-29 11:24:01,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:24:01,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:01,552 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-04-29 11:24:01,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:01,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:24:01,757 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:01,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1214741285, now seen corresponding path program 1 times [2025-04-29 11:24:01,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:01,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491966349] [2025-04-29 11:24:01,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:01,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:01,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:24:01,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:24:01,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:01,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:02,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:02,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491966349] [2025-04-29 11:24:02,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491966349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:02,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840155665] [2025-04-29 11:24:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:02,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:02,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:02,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:02,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:24:02,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:24:02,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:24:02,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:02,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:02,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:24:02,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:02,550 INFO L325 Elim1Store]: treesize reduction 65, result has 16.7 percent of original size [2025-04-29 11:24:02,550 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 46 [2025-04-29 11:24:02,571 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:24:02,582 INFO L325 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2025-04-29 11:24:02,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 16 [2025-04-29 11:24:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:02,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840155665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:02,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:24:02,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 22 [2025-04-29 11:24:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248074090] [2025-04-29 11:24:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:02,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:24:02,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:02,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:24:02,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:24:02,715 INFO L87 Difference]: Start difference. First operand 200 states and 236 transitions. Second operand has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 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-04-29 11:24:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,921 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2025-04-29 11:24:03,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:24:03,921 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 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-04-29 11:24:03,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,922 INFO L225 Difference]: With dead ends: 253 [2025-04-29 11:24:03,922 INFO L226 Difference]: Without dead ends: 253 [2025-04-29 11:24:03,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2025-04-29 11:24:03,923 INFO L437 NwaCegarLoop]: 152 mSDtfsCounter, 375 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 879 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-29 11:24:03,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-29 11:24:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2025-04-29 11:24:03,927 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-04-29 11:24:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2025-04-29 11:24:03,928 INFO L79 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 52 [2025-04-29 11:24:03,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,929 INFO L485 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2025-04-29 11:24:03,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 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-04-29 11:24:03,929 INFO L278 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2025-04-29 11:24:03,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-29 11:24:03,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,929 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-04-29 11:24:03,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:04,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:24:04,130 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:04,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1214741284, now seen corresponding path program 1 times [2025-04-29 11:24:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:04,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49874588] [2025-04-29 11:24:04,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:04,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:24:04,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:24:04,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:04,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49874588] [2025-04-29 11:24:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49874588] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:04,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794934826] [2025-04-29 11:24:04,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:04,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:04,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:04,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:24:05,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:24:05,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:24:05,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-29 11:24:05,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:05,268 WARN L871 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_~ans~0#1.base| Int)) (and (= (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| (select |c_#length| |DUPFFnew_~ans~0#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |DUPFFnew_~ans~0#1.base| (select |c_#valid| |DUPFFnew_~ans~0#1.base|))) (= (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|) 0))) is different from true [2025-04-29 11:24:05,594 INFO L325 Elim1Store]: treesize reduction 71, result has 15.5 percent of original size [2025-04-29 11:24:05,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 78 [2025-04-29 11:24:05,618 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:05,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 74 [2025-04-29 11:24:05,988 INFO L325 Elim1Store]: treesize reduction 57, result has 8.1 percent of original size [2025-04-29 11:24:05,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 21 [2025-04-29 11:24:06,003 INFO L325 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2025-04-29 11:24:06,003 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 1 [2025-04-29 11:24:06,017 INFO L325 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2025-04-29 11:24:06,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 1 [2025-04-29 11:24:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-04-29 11:24:06,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794934826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:06,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2025-04-29 11:24:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376867793] [2025-04-29 11:24:06,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-29 11:24:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-29 11:24:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2025-04-29 11:24:06,374 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 32 states, 29 states have (on average 3.103448275862069) internal successors, (90), 25 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-04-29 11:24:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:12,930 INFO L93 Difference]: Finished difference Result 253 states and 303 transitions. [2025-04-29 11:24:12,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:24:12,930 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 3.103448275862069) internal successors, (90), 25 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-04-29 11:24:12,931 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:12,932 INFO L225 Difference]: With dead ends: 253 [2025-04-29 11:24:12,932 INFO L226 Difference]: Without dead ends: 253 [2025-04-29 11:24:12,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=286, Invalid=2368, Unknown=2, NotChecked=100, Total=2756 [2025-04-29 11:24:12,932 INFO L437 NwaCegarLoop]: 139 mSDtfsCounter, 297 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:12,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1850 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 2481 Invalid, 0 Unknown, 263 Unchecked, 1.7s Time] [2025-04-29 11:24:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-29 11:24:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 233. [2025-04-29 11:24:12,940 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-04-29 11:24:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 280 transitions. [2025-04-29 11:24:12,941 INFO L79 Accepts]: Start accepts. Automaton has 233 states and 280 transitions. Word has length 52 [2025-04-29 11:24:12,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:12,941 INFO L485 AbstractCegarLoop]: Abstraction has 233 states and 280 transitions. [2025-04-29 11:24:12,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 3.103448275862069) internal successors, (90), 25 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-04-29 11:24:12,941 INFO L278 IsEmpty]: Start isEmpty. Operand 233 states and 280 transitions. [2025-04-29 11:24:12,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:24:12,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:12,942 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-04-29 11:24:12,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:13,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:13,143 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:13,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1555184116, now seen corresponding path program 1 times [2025-04-29 11:24:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:13,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076806363] [2025-04-29 11:24:13,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:13,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:24:13,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:24:13,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:13,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:24:13,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:13,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076806363] [2025-04-29 11:24:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076806363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:24:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382152939] [2025-04-29 11:24:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:13,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:24:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:13,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:24:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:24:13,303 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-04-29 11:24:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:13,654 INFO L93 Difference]: Finished difference Result 254 states and 304 transitions. [2025-04-29 11:24:13,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:24:13,655 INFO L79 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-04-29 11:24:13,655 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:13,656 INFO L225 Difference]: With dead ends: 254 [2025-04-29 11:24:13,656 INFO L226 Difference]: Without dead ends: 254 [2025-04-29 11:24:13,656 INFO L436 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-04-29 11:24:13,656 INFO L437 NwaCegarLoop]: 182 mSDtfsCounter, 57 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-04-29 11:24:13,657 INFO L438 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-04-29 11:24:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-04-29 11:24:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 241. [2025-04-29 11:24:13,662 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-04-29 11:24:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 290 transitions. [2025-04-29 11:24:13,664 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 290 transitions. Word has length 59 [2025-04-29 11:24:13,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:13,664 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 290 transitions. [2025-04-29 11:24:13,664 INFO L486 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-04-29 11:24:13,664 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 290 transitions. [2025-04-29 11:24:13,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:24:13,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:13,665 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-04-29 11:24:13,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:24:13,665 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:13,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1555184115, now seen corresponding path program 1 times [2025-04-29 11:24:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:13,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187309680] [2025-04-29 11:24:13,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:13,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:24:13,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:24:13,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:13,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:24:13,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:13,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187309680] [2025-04-29 11:24:13,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187309680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:13,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:13,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:24:13,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660443906] [2025-04-29 11:24:13,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:13,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:24:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:13,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:24:13,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:24:13,932 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-04-29 11:24:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:14,256 INFO L93 Difference]: Finished difference Result 255 states and 304 transitions. [2025-04-29 11:24:14,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:14,256 INFO L79 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-04-29 11:24:14,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:14,258 INFO L225 Difference]: With dead ends: 255 [2025-04-29 11:24:14,258 INFO L226 Difference]: Without dead ends: 255 [2025-04-29 11:24:14,258 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:24:14,259 INFO L437 NwaCegarLoop]: 184 mSDtfsCounter, 61 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:14,259 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1271 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:24:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-04-29 11:24:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2025-04-29 11:24:14,264 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-04-29 11:24:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 289 transitions. [2025-04-29 11:24:14,266 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 289 transitions. Word has length 59 [2025-04-29 11:24:14,266 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:14,266 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 289 transitions. [2025-04-29 11:24:14,266 INFO L486 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-04-29 11:24:14,266 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 289 transitions. [2025-04-29 11:24:14,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 11:24:14,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:14,266 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-04-29 11:24:14,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:24:14,267 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:14,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash -373059913, now seen corresponding path program 1 times [2025-04-29 11:24:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:14,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581418890] [2025-04-29 11:24:14,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:14,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:14,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:14,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:14,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:14,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:24:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:14,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581418890] [2025-04-29 11:24:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581418890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:14,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668117193] [2025-04-29 11:24:14,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:14,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:14,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:14,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:14,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:24:14,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:14,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:14,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:14,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:14,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:24:14,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:24:14,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:14,620 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:24:14,620 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-04-29 11:24:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:24:14,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668117193] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:14,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:14,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2025-04-29 11:24:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473472124] [2025-04-29 11:24:14,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:14,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:24:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:14,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:24:14,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:24:14,634 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-04-29 11:24:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:15,037 INFO L93 Difference]: Finished difference Result 265 states and 317 transitions. [2025-04-29 11:24:15,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:24:15,037 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 69 [2025-04-29 11:24:15,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:15,038 INFO L225 Difference]: With dead ends: 265 [2025-04-29 11:24:15,039 INFO L226 Difference]: Without dead ends: 265 [2025-04-29 11:24:15,039 INFO L436 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-04-29 11:24:15,039 INFO L437 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-04-29 11:24:15,040 INFO L438 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-04-29 11:24:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-29 11:24:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 242. [2025-04-29 11:24:15,045 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-04-29 11:24:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2025-04-29 11:24:15,046 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 69 [2025-04-29 11:24:15,046 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:15,046 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2025-04-29 11:24:15,046 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-04-29 11:24:15,046 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2025-04-29 11:24:15,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 11:24:15,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:15,048 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-04-29 11:24:15,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:15,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:24:15,248 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:15,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash -373059912, now seen corresponding path program 1 times [2025-04-29 11:24:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:15,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426135553] [2025-04-29 11:24:15,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:15,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:15,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:15,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:15,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:24:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:15,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426135553] [2025-04-29 11:24:15,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426135553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:15,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919288546] [2025-04-29 11:24:15,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:15,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:15,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:15,562 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:15,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:24:15,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:15,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:15,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:15,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:15,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-29 11:24:15,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:24:15,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:16,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:24:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:24:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919288546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:16,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 35 [2025-04-29 11:24:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28227333] [2025-04-29 11:24:16,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:16,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-29 11:24:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:16,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-29 11:24:16,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 11:24:16,220 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand has 36 states, 32 states have (on average 3.5) internal successors, (112), 24 states have internal predecessors, (112), 10 states have call successors, (17), 11 states have call predecessors, (17), 5 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-04-29 11:24:20,254 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 11:24:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:21,407 INFO L93 Difference]: Finished difference Result 299 states and 363 transitions. [2025-04-29 11:24:21,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:24:21,410 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 3.5) internal successors, (112), 24 states have internal predecessors, (112), 10 states have call successors, (17), 11 states have call predecessors, (17), 5 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 69 [2025-04-29 11:24:21,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:21,411 INFO L225 Difference]: With dead ends: 299 [2025-04-29 11:24:21,411 INFO L226 Difference]: Without dead ends: 299 [2025-04-29 11:24:21,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 11:24:21,412 INFO L437 NwaCegarLoop]: 181 mSDtfsCounter, 359 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 92 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:21,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 2454 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2299 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-04-29 11:24:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-04-29 11:24:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 282. [2025-04-29 11:24:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 217 states have internal predecessors, (237), 49 states have call successors, (49), 18 states have call predecessors, (49), 21 states have return successors, (59), 49 states have call predecessors, (59), 49 states have call successors, (59) [2025-04-29 11:24:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 345 transitions. [2025-04-29 11:24:21,419 INFO L79 Accepts]: Start accepts. Automaton has 282 states and 345 transitions. Word has length 69 [2025-04-29 11:24:21,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:21,420 INFO L485 AbstractCegarLoop]: Abstraction has 282 states and 345 transitions. [2025-04-29 11:24:21,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 3.5) internal successors, (112), 24 states have internal predecessors, (112), 10 states have call successors, (17), 11 states have call predecessors, (17), 5 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-04-29 11:24:21,420 INFO L278 IsEmpty]: Start isEmpty. Operand 282 states and 345 transitions. [2025-04-29 11:24:21,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-29 11:24:21,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:21,420 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-04-29 11:24:21,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:21,622 WARN L466 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-04-29 11:24:21,623 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:21,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:21,623 INFO L85 PathProgramCache]: Analyzing trace with hash -354865999, now seen corresponding path program 2 times [2025-04-29 11:24:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:21,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854560083] [2025-04-29 11:24:21,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:24:21,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:21,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-04-29 11:24:21,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 76 statements. [2025-04-29 11:24:21,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:24:21,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:24:21,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:21,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854560083] [2025-04-29 11:24:21,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854560083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:21,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:21,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:24:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312038633] [2025-04-29 11:24:21,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:21,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:24:21,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:21,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:24:21,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:24:21,784 INFO L87 Difference]: Start difference. First operand 282 states and 345 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-04-29 11:24:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:21,936 INFO L93 Difference]: Finished difference Result 285 states and 348 transitions. [2025-04-29 11:24:21,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:24:21,936 INFO L79 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-04-29 11:24:21,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:21,937 INFO L225 Difference]: With dead ends: 285 [2025-04-29 11:24:21,937 INFO L226 Difference]: Without dead ends: 285 [2025-04-29 11:24:21,937 INFO L436 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-04-29 11:24:21,938 INFO L437 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:21,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 792 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-04-29 11:24:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2025-04-29 11:24:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 219 states have internal predecessors, (239), 49 states have call successors, (49), 18 states have call predecessors, (49), 21 states have return successors, (59), 49 states have call predecessors, (59), 49 states have call successors, (59) [2025-04-29 11:24:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 347 transitions. [2025-04-29 11:24:21,943 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 347 transitions. Word has length 76 [2025-04-29 11:24:21,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:21,943 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 347 transitions. [2025-04-29 11:24:21,943 INFO L486 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-04-29 11:24:21,943 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 347 transitions. [2025-04-29 11:24:21,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-29 11:24:21,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:21,944 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-04-29 11:24:21,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:24:21,944 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:21,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2017497073, now seen corresponding path program 3 times [2025-04-29 11:24:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:21,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607032215] [2025-04-29 11:24:21,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:24:21,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:21,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-04-29 11:24:21,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-04-29 11:24:21,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:24:21,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:24:22,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:22,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607032215] [2025-04-29 11:24:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607032215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:22,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267802355] [2025-04-29 11:24:22,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:24:22,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:22,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:22,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:22,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:24:22,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 77 statements into 3 equivalence classes. [2025-04-29 11:24:22,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 77 statements. [2025-04-29 11:24:22,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:24:22,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:22,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-29 11:24:22,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:23,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:24:23,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2025-04-29 11:24:23,199 WARN L871 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_~ans~0#1.base| Int) (v_DerPreprocessor_4 Int)) (and (= (select (store |c_old(#valid)| |DUPFFnew_~ans~0#1.base| v_DerPreprocessor_4) |c_DUPFFnew_#t~mem3#1.base|) 0) (= (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| (select |c_#length| |DUPFFnew_~ans~0#1.base|)) |c_DUPFFnew_#t~mem3#1.base| (select |c_#length| |c_DUPFFnew_#t~mem3#1.base|)) |c_#length|) (= (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|) 0))) is different from true [2025-04-29 11:24:23,208 WARN L871 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_~ans~0#1.base| Int) (|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| Int) (v_DerPreprocessor_4 Int)) (and (= (select (store |c_old(#valid)| |DUPFFnew_~ans~0#1.base| v_DerPreprocessor_4) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| (select |c_#length| |DUPFFnew_~ans~0#1.base|)) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |DUPFFnew_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|) 0))) is different from true [2025-04-29 11:24:23,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:24:23,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:24:23,285 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:24:23,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 11 [2025-04-29 11:24:23,299 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-29 11:24:23,299 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2025-04-29 11:24:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 13 not checked. [2025-04-29 11:24:23,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267802355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:24,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:24,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2025-04-29 11:24:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794980373] [2025-04-29 11:24:24,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:24,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-29 11:24:24,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:24,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-29 11:24:24,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1441, Unknown=2, NotChecked=154, Total=1722 [2025-04-29 11:24:24,004 INFO L87 Difference]: Start difference. First operand 284 states and 347 transitions. Second operand has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 28 states have internal predecessors, (108), 6 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-04-29 11:24:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:26,873 INFO L93 Difference]: Finished difference Result 332 states and 402 transitions. [2025-04-29 11:24:26,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-29 11:24:26,873 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 28 states have internal predecessors, (108), 6 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-04-29 11:24:26,873 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:26,874 INFO L225 Difference]: With dead ends: 332 [2025-04-29 11:24:26,875 INFO L226 Difference]: Without dead ends: 323 [2025-04-29 11:24:26,875 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=370, Invalid=4058, Unknown=2, NotChecked=262, Total=4692 [2025-04-29 11:24:26,876 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 329 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 4506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 557 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:26,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1836 Invalid, 4506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 3797 Invalid, 0 Unknown, 557 Unchecked, 1.9s Time] [2025-04-29 11:24:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-04-29 11:24:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 280. [2025-04-29 11:24:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 182 states have (on average 1.2912087912087913) internal successors, (235), 216 states have internal predecessors, (235), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (53), 48 states have call predecessors, (53), 49 states have call successors, (53) [2025-04-29 11:24:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 337 transitions. [2025-04-29 11:24:26,884 INFO L79 Accepts]: Start accepts. Automaton has 280 states and 337 transitions. Word has length 77 [2025-04-29 11:24:26,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:26,884 INFO L485 AbstractCegarLoop]: Abstraction has 280 states and 337 transitions. [2025-04-29 11:24:26,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.176470588235294) internal successors, (108), 28 states have internal predecessors, (108), 6 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-04-29 11:24:26,884 INFO L278 IsEmpty]: Start isEmpty. Operand 280 states and 337 transitions. [2025-04-29 11:24:26,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-29 11:24:26,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:26,884 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-04-29 11:24:26,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:24:27,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:24:27,089 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:27,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash 363455763, now seen corresponding path program 1 times [2025-04-29 11:24:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:27,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970601673] [2025-04-29 11:24:27,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:27,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:24:27,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:24:27,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:27,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 11:24:27,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:27,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970601673] [2025-04-29 11:24:27,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970601673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:27,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:27,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899036740] [2025-04-29 11:24:27,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:27,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:27,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:27,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:27,139 INFO L87 Difference]: Start difference. First operand 280 states and 337 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:24:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:27,146 INFO L93 Difference]: Finished difference Result 283 states and 337 transitions. [2025-04-29 11:24:27,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:27,146 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 77 [2025-04-29 11:24:27,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:27,147 INFO L225 Difference]: With dead ends: 283 [2025-04-29 11:24:27,147 INFO L226 Difference]: Without dead ends: 280 [2025-04-29 11:24:27,147 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:27,147 INFO L437 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-04-29 11:24:27,147 INFO L438 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-04-29 11:24:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-04-29 11:24:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-04-29 11:24:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 182 states have (on average 1.2747252747252746) internal successors, (232), 216 states have internal predecessors, (232), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (53), 48 states have call predecessors, (53), 49 states have call successors, (53) [2025-04-29 11:24:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 334 transitions. [2025-04-29 11:24:27,155 INFO L79 Accepts]: Start accepts. Automaton has 280 states and 334 transitions. Word has length 77 [2025-04-29 11:24:27,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:27,155 INFO L485 AbstractCegarLoop]: Abstraction has 280 states and 334 transitions. [2025-04-29 11:24:27,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-04-29 11:24:27,155 INFO L278 IsEmpty]: Start isEmpty. Operand 280 states and 334 transitions. [2025-04-29 11:24:27,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-04-29 11:24:27,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:27,156 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-04-29 11:24:27,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:24:27,156 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:27,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash 149355139, now seen corresponding path program 1 times [2025-04-29 11:24:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:27,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914361808] [2025-04-29 11:24:27,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:27,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:24:27,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:24:27,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:27,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-29 11:24:27,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:27,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914361808] [2025-04-29 11:24:27,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914361808] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:27,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117313967] [2025-04-29 11:24:27,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:27,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:27,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:27,344 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:27,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:24:27,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:24:27,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:24:27,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:27,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:27,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:24:27,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:27,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:24:27,610 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:24:27,610 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:24:27,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:24:27,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-29 11:24:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-29 11:24:27,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117313967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:27,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:24:27,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 25 [2025-04-29 11:24:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919220067] [2025-04-29 11:24:27,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:27,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:24:27,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:27,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:24:27,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:24:27,909 INFO L87 Difference]: Start difference. First operand 280 states and 334 transitions. Second operand has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:24:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:28,707 INFO L93 Difference]: Finished difference Result 275 states and 320 transitions. [2025-04-29 11:24:28,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:24:28,707 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2025-04-29 11:24:28,707 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:28,708 INFO L225 Difference]: With dead ends: 275 [2025-04-29 11:24:28,708 INFO L226 Difference]: Without dead ends: 272 [2025-04-29 11:24:28,709 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2025-04-29 11:24:28,709 INFO L437 NwaCegarLoop]: 156 mSDtfsCounter, 96 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 80 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:28,709 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1564 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1297 Invalid, 1 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 11:24:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-29 11:24:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2025-04-29 11:24:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 173 states have (on average 1.260115606936416) internal successors, (218), 206 states have internal predecessors, (218), 45 states have call successors, (45), 18 states have call predecessors, (45), 19 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-04-29 11:24:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 312 transitions. [2025-04-29 11:24:28,715 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 312 transitions. Word has length 84 [2025-04-29 11:24:28,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:28,715 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 312 transitions. [2025-04-29 11:24:28,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 5 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-04-29 11:24:28,715 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 312 transitions. [2025-04-29 11:24:28,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-04-29 11:24:28,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:28,717 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-04-29 11:24:28,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:24:28,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-29 11:24:28,917 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:28,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash -595031201, now seen corresponding path program 1 times [2025-04-29 11:24:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:28,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951777439] [2025-04-29 11:24:28,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:28,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-29 11:24:28,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-29 11:24:28,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:28,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-04-29 11:24:29,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:29,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951777439] [2025-04-29 11:24:29,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951777439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:29,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810156146] [2025-04-29 11:24:29,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:29,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:29,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:29,098 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:29,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:24:29,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-29 11:24:29,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-29 11:24:29,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:29,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:29,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-29 11:24:29,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:29,313 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:24:29,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:24:29,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 11:24:29,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-29 11:24:29,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-29 11:24:29,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-29 11:24:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-29 11:24:29,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-29 11:24:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810156146] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:29,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:29,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 18 [2025-04-29 11:24:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297659442] [2025-04-29 11:24:29,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:29,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:24:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:29,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:24:29,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:24:29,803 INFO L87 Difference]: Start difference. First operand 267 states and 312 transitions. Second operand has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 15 states have internal predecessors, (101), 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-04-29 11:24:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:30,768 INFO L93 Difference]: Finished difference Result 336 states and 400 transitions. [2025-04-29 11:24:30,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-29 11:24:30,768 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 15 states have internal predecessors, (101), 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-04-29 11:24:30,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:30,770 INFO L225 Difference]: With dead ends: 336 [2025-04-29 11:24:30,770 INFO L226 Difference]: Without dead ends: 330 [2025-04-29 11:24:30,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 181 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-04-29 11:24:30,770 INFO L437 NwaCegarLoop]: 207 mSDtfsCounter, 135 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:30,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2598 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:24:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-29 11:24:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 268. [2025-04-29 11:24:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 174 states have (on average 1.2528735632183907) internal successors, (218), 207 states have internal predecessors, (218), 45 states have call successors, (45), 18 states have call predecessors, (45), 19 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-04-29 11:24:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 312 transitions. [2025-04-29 11:24:30,777 INFO L79 Accepts]: Start accepts. Automaton has 268 states and 312 transitions. Word has length 101 [2025-04-29 11:24:30,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:30,777 INFO L485 AbstractCegarLoop]: Abstraction has 268 states and 312 transitions. [2025-04-29 11:24:30,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 15 states have internal predecessors, (101), 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-04-29 11:24:30,777 INFO L278 IsEmpty]: Start isEmpty. Operand 268 states and 312 transitions. [2025-04-29 11:24:30,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-04-29 11:24:30,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:30,778 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-04-29 11:24:30,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:30,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:24:30,979 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFexgcdErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:30,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash -566197864, now seen corresponding path program 1 times [2025-04-29 11:24:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:30,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890247286] [2025-04-29 11:24:30,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:30,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-29 11:24:31,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-29 11:24:31,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:31,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-04-29 11:24:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:31,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890247286] [2025-04-29 11:24:31,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890247286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:31,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068905155] [2025-04-29 11:24:31,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:31,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:31,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:31,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:24:31,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-29 11:24:31,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-29 11:24:31,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:31,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:31,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-04-29 11:24:31,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:31,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:24:31,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:24:31,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-29 11:24:31,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2025-04-29 11:24:31,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2025-04-29 11:24:31,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2025-04-29 11:24:31,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-04-29 11:24:31,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2025-04-29 11:24:31,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 26 [2025-04-29 11:24:32,098 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-04-29 11:24:32,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-04-29 11:24:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-29 11:24:32,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-29 11:24:32,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068905155] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:32,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 38 [2025-04-29 11:24:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94728393] [2025-04-29 11:24:32,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:32,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-29 11:24:32,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:32,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-29 11:24:32,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:24:32,816 INFO L87 Difference]: Start difference. First operand 268 states and 312 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-04-29 11:24:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:35,066 INFO L93 Difference]: Finished difference Result 312 states and 370 transitions. [2025-04-29 11:24:35,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-29 11:24:35,066 INFO L79 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-04-29 11:24:35,067 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:35,068 INFO L225 Difference]: With dead ends: 312 [2025-04-29 11:24:35,068 INFO L226 Difference]: Without dead ends: 306 [2025-04-29 11:24:35,069 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 165 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=474, Invalid=3432, Unknown=0, NotChecked=0, Total=3906 [2025-04-29 11:24:35,069 INFO L437 NwaCegarLoop]: 196 mSDtfsCounter, 181 mSDsluCounter, 4620 mSDsCounter, 0 mSdLazyCounter, 3191 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:35,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 4816 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3191 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-29 11:24:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-29 11:24:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 269. [2025-04-29 11:24:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 175 states have (on average 1.2457142857142858) internal successors, (218), 208 states have internal predecessors, (218), 45 states have call successors, (45), 18 states have call predecessors, (45), 19 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-04-29 11:24:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 312 transitions. [2025-04-29 11:24:35,078 INFO L79 Accepts]: Start accepts. Automaton has 269 states and 312 transitions. Word has length 102 [2025-04-29 11:24:35,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:35,078 INFO L485 AbstractCegarLoop]: Abstraction has 269 states and 312 transitions. [2025-04-29 11:24:35,079 INFO L486 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-04-29 11:24:35,079 INFO L278 IsEmpty]: Start isEmpty. Operand 269 states and 312 transitions. [2025-04-29 11:24:35,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-04-29 11:24:35,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:35,080 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-04-29 11:24:35,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:24:35,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:24:35,280 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:35,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1383599046, now seen corresponding path program 1 times [2025-04-29 11:24:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:35,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119750525] [2025-04-29 11:24:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:35,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-04-29 11:24:35,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-04-29 11:24:35,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:35,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-04-29 11:24:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:35,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119750525] [2025-04-29 11:24:35,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119750525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:35,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768488859] [2025-04-29 11:24:35,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:35,546 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:35,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:24:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-04-29 11:24:35,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-04-29 11:24:35,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:35,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:35,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:24:35,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-04-29 11:24:35,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-04-29 11:24:36,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768488859] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:36,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2025-04-29 11:24:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559333174] [2025-04-29 11:24:36,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:36,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 11:24:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:36,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 11:24:36,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:24:36,081 INFO L87 Difference]: Start difference. First operand 269 states and 312 transitions. Second operand has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-04-29 11:24:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:36,778 INFO L93 Difference]: Finished difference Result 308 states and 365 transitions. [2025-04-29 11:24:36,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-29 11:24:36,779 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2025-04-29 11:24:36,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:36,780 INFO L225 Difference]: With dead ends: 308 [2025-04-29 11:24:36,780 INFO L226 Difference]: Without dead ends: 296 [2025-04-29 11:24:36,780 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=603, Invalid=1947, Unknown=0, NotChecked=0, Total=2550 [2025-04-29 11:24:36,781 INFO L437 NwaCegarLoop]: 190 mSDtfsCounter, 198 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:36,781 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1991 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:24:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-29 11:24:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 276. [2025-04-29 11:24:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 182 states have (on average 1.2362637362637363) internal successors, (225), 215 states have internal predecessors, (225), 45 states have call successors, (45), 18 states have call predecessors, (45), 19 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-04-29 11:24:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 319 transitions. [2025-04-29 11:24:36,785 INFO L79 Accepts]: Start accepts. Automaton has 276 states and 319 transitions. Word has length 111 [2025-04-29 11:24:36,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:36,785 INFO L485 AbstractCegarLoop]: Abstraction has 276 states and 319 transitions. [2025-04-29 11:24:36,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 2 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-04-29 11:24:36,785 INFO L278 IsEmpty]: Start isEmpty. Operand 276 states and 319 transitions. [2025-04-29 11:24:36,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-04-29 11:24:36,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:36,787 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-04-29 11:24:36,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:24:36,987 WARN L466 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-04-29 11:24:36,988 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2025-04-29 11:24:36,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash 59273214, now seen corresponding path program 2 times [2025-04-29 11:24:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:36,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187165153] [2025-04-29 11:24:36,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:24:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:37,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-04-29 11:24:37,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-04-29 11:24:37,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:24:37,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 49 proven. 21 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-04-29 11:24:37,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:37,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187165153] [2025-04-29 11:24:37,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187165153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:37,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936041592] [2025-04-29 11:24:37,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:24:37,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:37,937 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:37,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:24:38,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-04-29 11:24:38,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-04-29 11:24:38,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:24:38,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:38,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-29 11:24:38,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 50 proven. 10 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-04-29 11:24:38,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-04-29 11:24:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936041592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:38,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:38,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 33 [2025-04-29 11:24:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958241698] [2025-04-29 11:24:38,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:38,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:24:38,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:38,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:24:38,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:24:38,712 INFO L87 Difference]: Start difference. First operand 276 states and 319 transitions. Second operand has 33 states, 33 states have (on average 4.424242424242424) internal successors, (146), 33 states have internal predecessors, (146), 2 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-04-29 11:24:47,408 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 100 DAG size of output: 64 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15