./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:16:53,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:16:53,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:16:53,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:16:53,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:16:53,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:16:53,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:16:53,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:16:53,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:16:53,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:16:53,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:16:53,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:16:53,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:16:53,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:16:53,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:16:53,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:16:53,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:16:53,301 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 ! call(reach_error())) ) 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 -> 0e14b8baad7c8f50637b16b3adcb891ef363d7563e7c4e0e74695e7b8e3d1787 [2025-03-03 13:16:53,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:16:53,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:16:53,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:16:53,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:16:53,555 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:16:53,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2025-03-03 13:16:54,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8a42ca7/3a63ae86820741feadd87fd86e44109e/FLAG6a526fc58 [2025-03-03 13:16:54,928 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:16:54,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i [2025-03-03 13:16:54,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8a42ca7/3a63ae86820741feadd87fd86e44109e/FLAG6a526fc58 [2025-03-03 13:16:54,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c8a42ca7/3a63ae86820741feadd87fd86e44109e [2025-03-03 13:16:54,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:16:54,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:16:54,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:16:54,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:16:54,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:16:54,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:16:54" (1/1) ... [2025-03-03 13:16:54,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:54, skipping insertion in model container [2025-03-03 13:16:54,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:16:54" (1/1) ... [2025-03-03 13:16:54,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:16:55,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2025-03-03 13:16:55,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:16:55,241 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:16:55,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-1.i[22634,22647] [2025-03-03 13:16:55,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:16:55,296 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:16:55,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55 WrapperNode [2025-03-03 13:16:55,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:16:55,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:16:55,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:16:55,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:16:55,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,324 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 199 [2025-03-03 13:16:55,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:16:55,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:16:55,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:16:55,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:16:55,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,363 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 6, 40]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 2, 11]. [2025-03-03 13:16:55,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:16:55,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:16:55,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:16:55,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:16:55,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (1/1) ... [2025-03-03 13:16:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:16:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:55,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:16:55,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:16:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-03 13:16:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-03 13:16:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2025-03-03 13:16:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2025-03-03 13:16:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 13:16:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:16:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2025-03-03 13:16:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2025-03-03 13:16:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-03 13:16:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2025-03-03 13:16:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2025-03-03 13:16:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2025-03-03 13:16:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2025-03-03 13:16:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:16:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:16:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:16:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:16:55,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:16:55,527 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:16:55,528 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:16:55,544 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc #t~ret12.base, #t~ret12.offset; [2025-03-03 13:16:55,627 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L593: havoc #t~mem11.base, #t~mem11.offset;call ULTIMATE.dealloc(~#dll~0.base, ~#dll~0.offset);havoc ~#dll~0.base, ~#dll~0.offset; [2025-03-03 13:16:55,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc dll_create_master_#t~ret21#1.base, dll_create_master_#t~ret21#1.offset; [2025-03-03 13:16:55,824 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-03-03 13:16:55,825 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:16:55,832 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:16:55,832 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:16:55,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:16:55 BoogieIcfgContainer [2025-03-03 13:16:55,832 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:16:55,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:16:55,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:16:55,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:16:55,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:16:54" (1/3) ... [2025-03-03 13:16:55,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68764998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:16:55, skipping insertion in model container [2025-03-03 13:16:55,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:16:55" (2/3) ... [2025-03-03 13:16:55,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68764998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:16:55, skipping insertion in model container [2025-03-03 13:16:55,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:16:55" (3/3) ... [2025-03-03 13:16:55,839 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_of_dll-1.i [2025-03-03 13:16:55,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:16:55,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_of_dll-1.i that has 7 procedures, 127 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-03 13:16:55,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:16:55,906 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@23b08c71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:16:55,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:16:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 115 states have internal predecessors, (154), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 13:16:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:16:55,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:55,917 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 13:16:55,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:55,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1954975430, now seen corresponding path program 1 times [2025-03-03 13:16:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:55,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806547991] [2025-03-03 13:16:55,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:56,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:16:56,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:16:56,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:56,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:16:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:16:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806547991] [2025-03-03 13:16:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806547991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:16:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827258129] [2025-03-03 13:16:56,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:56,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:56,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:56,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:16:56,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 13:16:56,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:16:56,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:16:56,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:56,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:56,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:16:56,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:16:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 13:16:56,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:16:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827258129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:16:56,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:16:56,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:16:56,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839555591] [2025-03-03 13:16:56,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:16:56,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:16:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:16:56,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:16:56,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:16:56,335 INFO L87 Difference]: Start difference. First operand has 127 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 115 states have internal predecessors, (154), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:16:56,363 INFO L93 Difference]: Finished difference Result 249 states and 409 transitions. [2025-03-03 13:16:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:16:56,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-03 13:16:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:16:56,374 INFO L225 Difference]: With dead ends: 249 [2025-03-03 13:16:56,374 INFO L226 Difference]: Without dead ends: 119 [2025-03-03 13:16:56,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:16:56,379 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:16:56,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:16:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-03 13:16:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-03 13:16:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 107 states have internal predecessors, (114), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:16:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2025-03-03 13:16:56,415 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 37 [2025-03-03 13:16:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:16:56,415 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2025-03-03 13:16:56,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:56,416 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2025-03-03 13:16:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 13:16:56,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:56,417 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 13:16:56,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 13:16:56,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 13:16:56,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:56,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:56,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2067303042, now seen corresponding path program 1 times [2025-03-03 13:16:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:56,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-03-03 13:16:56,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:56,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:16:56,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:16:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:16:57,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:16:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339537256] [2025-03-03 13:16:57,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339537256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:16:57,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829391470] [2025-03-03 13:16:57,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:57,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:57,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:57,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:16:57,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 13:16:57,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 13:16:57,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 13:16:57,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:57,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:57,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:16:57,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:16:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:16:57,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:16:57,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829391470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:16:57,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:16:57,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-03 13:16:57,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741688597] [2025-03-03 13:16:57,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:16:57,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:16:57,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:16:57,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:16:57,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:16:57,460 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:16:57,544 INFO L93 Difference]: Finished difference Result 248 states and 322 transitions. [2025-03-03 13:16:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:16:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-03 13:16:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:16:57,547 INFO L225 Difference]: With dead ends: 248 [2025-03-03 13:16:57,547 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 13:16:57,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:16:57,572 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 14 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:16:57,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 550 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:16:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 13:16:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-03 13:16:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.268041237113402) internal successors, (123), 115 states have internal predecessors, (123), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 13:16:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2025-03-03 13:16:57,583 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 38 [2025-03-03 13:16:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:16:57,583 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2025-03-03 13:16:57,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:16:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2025-03-03 13:16:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 13:16:57,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:57,586 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 13:16:57,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:16:57,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 13:16:57,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:57,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2078697854, now seen corresponding path program 1 times [2025-03-03 13:16:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:57,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895021214] [2025-03-03 13:16:57,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:57,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:16:57,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:16:57,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:57,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 13:16:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:16:58,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895021214] [2025-03-03 13:16:58,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895021214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:16:58,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542640335] [2025-03-03 13:16:58,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:58,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:16:58,766 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:16:58,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:16:58,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:16:59,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:16:59,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:59,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:16:59,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 13:16:59,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:16:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 13:16:59,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:16:59,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542640335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:16:59,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:16:59,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 13 [2025-03-03 13:16:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105162237] [2025-03-03 13:16:59,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:16:59,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:16:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:16:59,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:16:59,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:16:59,128 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 13:16:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:16:59,426 INFO L93 Difference]: Finished difference Result 263 states and 332 transitions. [2025-03-03 13:16:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:16:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-03-03 13:16:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:16:59,427 INFO L225 Difference]: With dead ends: 263 [2025-03-03 13:16:59,427 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 13:16:59,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:16:59,428 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 47 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:16:59,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 562 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:16:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 13:16:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-03 13:16:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 100 states have (on average 1.26) internal successors, (126), 119 states have internal predecessors, (126), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (15), 11 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-03 13:16:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions. [2025-03-03 13:16:59,438 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 110 [2025-03-03 13:16:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:16:59,438 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 168 transitions. [2025-03-03 13:16:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 13:16:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions. [2025-03-03 13:16:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 13:16:59,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:16:59,440 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 13:16:59,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:16:59,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:16:59,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:16:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:16:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1793174366, now seen corresponding path program 1 times [2025-03-03 13:16:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:16:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899539862] [2025-03-03 13:16:59,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:16:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:16:59,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:16:59,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:16:59,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:16:59,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 13:17:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899539862] [2025-03-03 13:17:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899539862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576904466] [2025-03-03 13:17:00,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:00,264 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:17:00,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:17:00,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:17:00,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:17:00,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:00,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:00,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 13:17:00,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 13:17:00,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 13:17:01,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576904466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:01,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:01,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2025-03-03 13:17:01,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495680137] [2025-03-03 13:17:01,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:01,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:17:01,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:01,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:17:01,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:17:01,185 INFO L87 Difference]: Start difference. First operand 136 states and 168 transitions. Second operand has 17 states, 15 states have (on average 5.2) internal successors, (78), 13 states have internal predecessors, (78), 7 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-03 13:17:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:01,572 INFO L93 Difference]: Finished difference Result 273 states and 339 transitions. [2025-03-03 13:17:01,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:17:01,573 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.2) internal successors, (78), 13 states have internal predecessors, (78), 7 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) Word has length 110 [2025-03-03 13:17:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:01,574 INFO L225 Difference]: With dead ends: 273 [2025-03-03 13:17:01,574 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 13:17:01,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:17:01,575 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 88 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:01,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 679 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:17:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 13:17:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-03 13:17:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 123 states have internal predecessors, (129), 28 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-03 13:17:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2025-03-03 13:17:01,586 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 110 [2025-03-03 13:17:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:01,586 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2025-03-03 13:17:01,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.2) internal successors, (78), 13 states have internal predecessors, (78), 7 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-03 13:17:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2025-03-03 13:17:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 13:17:01,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:01,588 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 13:17:01,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:17:01,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:01,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:01,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash 839972733, now seen corresponding path program 1 times [2025-03-03 13:17:01,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:01,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586672061] [2025-03-03 13:17:01,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:01,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:17:01,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:17:01,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:01,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 13:17:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586672061] [2025-03-03 13:17:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586672061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986658269] [2025-03-03 13:17:02,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:02,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:02,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:02,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:17:02,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:17:02,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 13:17:02,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 13:17:02,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:02,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:02,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-03 13:17:02,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:02,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:16,004 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2025-03-03 13:17:16,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 79 [2025-03-03 13:17:16,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2025-03-03 13:17:16,030 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-03 13:17:16,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-03-03 13:17:16,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-03 13:17:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 13:17:16,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:16,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986658269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:16,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:17:16,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 30] total 31 [2025-03-03 13:17:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083419913] [2025-03-03 13:17:16,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:16,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 13:17:16,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:16,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 13:17:16,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=897, Unknown=8, NotChecked=0, Total=992 [2025-03-03 13:17:16,734 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 31 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 12 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-03 13:17:21,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:17:25,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:17:32,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 13:17:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:33,543 INFO L93 Difference]: Finished difference Result 276 states and 346 transitions. [2025-03-03 13:17:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 13:17:33,543 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 12 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) Word has length 110 [2025-03-03 13:17:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:33,545 INFO L225 Difference]: With dead ends: 276 [2025-03-03 13:17:33,545 INFO L226 Difference]: Without dead ends: 215 [2025-03-03 13:17:33,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=211, Invalid=2216, Unknown=23, NotChecked=0, Total=2450 [2025-03-03 13:17:33,546 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 39 mSolverCounterUnsat, 71 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 71 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:33,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2339 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2057 Invalid, 71 Unknown, 0 Unchecked, 12.4s Time] [2025-03-03 13:17:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-03 13:17:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 180. [2025-03-03 13:17:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 156 states have internal predecessors, (171), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2025-03-03 13:17:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 220 transitions. [2025-03-03 13:17:33,570 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 220 transitions. Word has length 110 [2025-03-03 13:17:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:33,570 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 220 transitions. [2025-03-03 13:17:33,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.888888888888889) internal successors, (78), 26 states have internal predecessors, (78), 12 states have call successors, (17), 4 states have call predecessors, (17), 8 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-03 13:17:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 220 transitions. [2025-03-03 13:17:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 13:17:33,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:33,572 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 13:17:33,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:17:33,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:33,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:33,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1502004620, now seen corresponding path program 1 times [2025-03-03 13:17:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:33,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615386481] [2025-03-03 13:17:33,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:33,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 13:17:33,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 13:17:33,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:33,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 13:17:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615386481] [2025-03-03 13:17:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615386481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849862216] [2025-03-03 13:17:34,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:34,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:34,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:34,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:17:34,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:17:34,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 13:17:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 13:17:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:34,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:17:34,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:34,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 13:17:34,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:17:35,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-03 13:17:35,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-03 13:17:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 13:17:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849862216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:17:35,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:17:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 23 [2025-03-03 13:17:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106815743] [2025-03-03 13:17:35,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:17:35,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 13:17:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:17:35,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 13:17:35,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-03 13:17:35,384 INFO L87 Difference]: Start difference. First operand 180 states and 220 transitions. Second operand has 23 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 18 states have internal predecessors, (61), 9 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-03 13:17:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:17:36,151 INFO L93 Difference]: Finished difference Result 346 states and 421 transitions. [2025-03-03 13:17:36,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 13:17:36,151 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 18 states have internal predecessors, (61), 9 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 113 [2025-03-03 13:17:36,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:17:36,153 INFO L225 Difference]: With dead ends: 346 [2025-03-03 13:17:36,153 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 13:17:36,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:17:36,154 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 60 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:17:36,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1259 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 13:17:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 13:17:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-03 13:17:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 139 states have (on average 1.223021582733813) internal successors, (170), 156 states have internal predecessors, (170), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (17), 13 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-03 13:17:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-03-03 13:17:36,166 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 113 [2025-03-03 13:17:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:17:36,167 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-03-03 13:17:36,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 18 states have internal predecessors, (61), 9 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-03 13:17:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-03-03 13:17:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 13:17:36,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:17:36,169 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 13:17:36,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:17:36,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:36,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:17:36,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:17:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1063995117, now seen corresponding path program 1 times [2025-03-03 13:17:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:17:36,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201874951] [2025-03-03 13:17:36,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:17:36,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 13:17:36,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 13:17:36,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:36,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 13:17:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:17:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201874951] [2025-03-03 13:17:43,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201874951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:17:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114626025] [2025-03-03 13:17:43,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:17:43,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:17:43,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:17:43,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:17:43,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:17:43,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 13:17:43,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 13:17:43,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:17:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:17:43,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 236 conjuncts are in the unsatisfiable core [2025-03-03 13:17:43,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:17:43,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 13:17:43,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:17:43,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-03 13:17:43,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 13:17:43,812 INFO L349 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2025-03-03 13:17:43,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2025-03-03 13:17:44,135 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offset| 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= (select |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|))) (or (exists ((|v_#memory_$Pointer$#2.base_620| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |v_#memory_$Pointer$#2.base_620|))) (and (= (store |v_#memory_$Pointer$#2.base_620| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| .cse0) |c_#memory_$Pointer$#2.base|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| .cse1) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |v_#memory_$Pointer$#2.base_620| .cse1)) |v_#memory_$Pointer$#2.base_620|)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| .cse0) |c_#memory_$Pointer$#2.base|)))) is different from false [2025-03-03 13:17:44,137 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.offset| |c_##fun~$Pointer$~TO~VOID_#in~10#1.offset|) (= |c_##fun~$Pointer$~TO~VOID_#in~10#1.base| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~dll#1.base|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.offset| 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|) (= (select |c_old(#valid)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|) 0) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base|))) (or (exists ((|v_#memory_$Pointer$#2.base_620| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |c_old(#memory_$Pointer$#2.base)| |v_#memory_$Pointer$#2.base_620|))) (and (= (store |v_#memory_$Pointer$#2.base_620| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| .cse0) |c_#memory_$Pointer$#2.base|) (= |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| .cse1) (= (store |c_old(#memory_$Pointer$#2.base)| .cse1 (select |v_#memory_$Pointer$#2.base_620| .cse1)) |v_#memory_$Pointer$#2.base_620|)))) (= (store |c_old(#memory_$Pointer$#2.base)| |c_##fun~$Pointer$~TO~VOID_dll_insert_slave_~item~0#1.base| .cse0) |c_#memory_$Pointer$#2.base|)))) is different from true [2025-03-03 13:17:44,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-03 13:17:44,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2025-03-03 13:17:44,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4