./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-2.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 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:50:56,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:50:56,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:50:56,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:50:56,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:50:56,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:50:56,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:50:56,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:50:56,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:50:56,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:50:56,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:50:56,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:50:56,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:50:56,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:50:56,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:50:56,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:50:56,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:50:56,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:50:56,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:50:56,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:50:56,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:50:56,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:50:56,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:50:56,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:50:56,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:50:56,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:50:56,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:50:56,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:50:56,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:50:56,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:50:56,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:50:56,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:50:56,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:50:56,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:50:56,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:50:56,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:50:56,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:50:56,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:50:56,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:50:56,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:50:56,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:50:56,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:50:56,741 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2024-11-08 13:50:56,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:50:56,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:50:56,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:50:56,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:50:56,955 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:50:56,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2024-11-08 13:50:58,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:50:58,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:50:58,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2024-11-08 13:50:58,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855727e33/439cb480cd9540f1b168773ffea96c52/FLAG93fde9f51 [2024-11-08 13:50:58,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855727e33/439cb480cd9540f1b168773ffea96c52 [2024-11-08 13:50:58,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:50:58,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:50:58,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:50:58,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:50:58,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:50:58,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:50:58" (1/1) ... [2024-11-08 13:50:58,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458351f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:58, skipping insertion in model container [2024-11-08 13:50:58,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:50:58" (1/1) ... [2024-11-08 13:50:58,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:50:59,105 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-2.i[22634,22647] [2024-11-08 13:50:59,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:50:59,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:50:59,177 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-2.i[22634,22647] [2024-11-08 13:50:59,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:50:59,237 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:50:59,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59 WrapperNode [2024-11-08 13:50:59,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:50:59,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:50:59,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:50:59,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:50:59,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,287 INFO L138 Inliner]: procedures = 140, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 231 [2024-11-08 13:50:59,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:50:59,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:50:59,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:50:59,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:50:59,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,337 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 40, 6]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 13 writes are split as follows [0, 11, 2]. [2024-11-08 13:50:59,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:50:59,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:50:59,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:50:59,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:50:59,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (1/1) ... [2024-11-08 13:50:59,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:50:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:59,392 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) [2024-11-08 13:50:59,394 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 [2024-11-08 13:50:59,432 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-08 13:50:59,434 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-08 13:50:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2024-11-08 13:50:59,435 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2024-11-08 13:50:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:50:59,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:50:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2024-11-08 13:50:59,436 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2024-11-08 13:50:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:50:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:50:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:50:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:50:59,436 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-11-08 13:50:59,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-11-08 13:50:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:50:59,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:50:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:50:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:50:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:50:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:50:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:50:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2024-11-08 13:50:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2024-11-08 13:50:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2024-11-08 13:50:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2024-11-08 13:50:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:50:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:50:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:50:59,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:50:59,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:50:59,616 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:50:59,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:50:59,884 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-08 13:50:59,884 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:50:59,897 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:50:59,898 INFO L316 CfgBuilder]: Removed 38 assume(true) statements. [2024-11-08 13:50:59,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:50:59 BoogieIcfgContainer [2024-11-08 13:50:59,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:50:59,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:50:59,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:50:59,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:50:59,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:50:58" (1/3) ... [2024-11-08 13:50:59,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea3bbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:50:59, skipping insertion in model container [2024-11-08 13:50:59,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:50:59" (2/3) ... [2024-11-08 13:50:59,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea3bbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:50:59, skipping insertion in model container [2024-11-08 13:50:59,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:50:59" (3/3) ... [2024-11-08 13:50:59,905 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2024-11-08 13:50:59,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:50:59,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:50:59,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:50:59,975 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;@3142e3dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:50:59,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:50:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 117 states have internal predecessors, (165), 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) [2024-11-08 13:50:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:50:59,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:59,986 INFO L215 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] [2024-11-08 13:50:59,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:59,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:59,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2003566147, now seen corresponding path program 1 times [2024-11-08 13:50:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806911642] [2024-11-08 13:50:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:59,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:51:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 13:51:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806911642] [2024-11-08 13:51:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806911642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:00,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:51:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351289403] [2024-11-08 13:51:00,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:00,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:51:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:00,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:51:00,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:51:00,422 INFO L87 Difference]: Start difference. First operand has 129 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 117 states have internal predecessors, (165), 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 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2024-11-08 13:51:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:00,570 INFO L93 Difference]: Finished difference Result 253 states and 431 transitions. [2024-11-08 13:51:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:51:00,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 [2024-11-08 13:51:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:00,578 INFO L225 Difference]: With dead ends: 253 [2024-11-08 13:51:00,578 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 13:51:00,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:51:00,584 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:00,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 183 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 13:51:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 13:51:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 109 states have internal predecessors, (116), 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) [2024-11-08 13:51:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2024-11-08 13:51:00,632 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 37 [2024-11-08 13:51:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:00,632 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2024-11-08 13:51:00,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2024-11-08 13:51:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2024-11-08 13:51:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:51:00,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:00,637 INFO L215 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] [2024-11-08 13:51:00,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:51:00,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:00,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1625779, now seen corresponding path program 1 times [2024-11-08 13:51:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:00,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353485673] [2024-11-08 13:51:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:51:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:01,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353485673] [2024-11-08 13:51:01,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353485673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:01,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364369439] [2024-11-08 13:51:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:01,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:01,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:01,531 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) [2024-11-08 13:51:01,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:51:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:01,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 13:51:01,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:51:01,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:51:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364369439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:02,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:02,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 18 [2024-11-08 13:51:02,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733223430] [2024-11-08 13:51:02,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:02,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 13:51:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:02,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 13:51:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-08 13:51:02,090 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 13:51:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:03,105 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2024-11-08 13:51:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 13:51:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2024-11-08 13:51:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:03,108 INFO L225 Difference]: With dead ends: 263 [2024-11-08 13:51:03,108 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 13:51:03,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 13:51:03,111 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 66 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:03,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1197 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 13:51:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 13:51:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-08 13:51:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 108 states have (on average 1.2407407407407407) internal successors, (134), 126 states have internal predecessors, (134), 27 states have call successors, (27), 9 states have call predecessors, (27), 8 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-08 13:51:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2024-11-08 13:51:03,128 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 38 [2024-11-08 13:51:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:03,129 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2024-11-08 13:51:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 13:51:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2024-11-08 13:51:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 13:51:03,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:03,132 INFO L215 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] [2024-11-08 13:51:03,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:51:03,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:03,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:03,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1447704685, now seen corresponding path program 1 times [2024-11-08 13:51:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919157617] [2024-11-08 13:51:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:51:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 13:51:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:51:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 13:51:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:51:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 13:51:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:51:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-08 13:51:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919157617] [2024-11-08 13:51:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919157617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:05,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126340288] [2024-11-08 13:51:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:05,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:05,346 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) [2024-11-08 13:51:05,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:51:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:05,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 13:51:05,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:05,672 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 [2024-11-08 13:51:05,697 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 [2024-11-08 13:51:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 13:51:05,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:06,023 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 [2024-11-08 13:51:06,031 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 [2024-11-08 13:51:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 13:51:06,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126340288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:06,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:06,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 23 [2024-11-08 13:51:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131351212] [2024-11-08 13:51:06,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:06,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 13:51:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:06,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 13:51:06,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2024-11-08 13:51:06,156 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 23 states, 21 states have (on average 3.238095238095238) internal successors, (68), 19 states have internal predecessors, (68), 9 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2024-11-08 13:51:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:07,250 INFO L93 Difference]: Finished difference Result 360 states and 443 transitions. [2024-11-08 13:51:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 13:51:07,251 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.238095238095238) internal successors, (68), 19 states have internal predecessors, (68), 9 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) Word has length 110 [2024-11-08 13:51:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:07,256 INFO L225 Difference]: With dead ends: 360 [2024-11-08 13:51:07,257 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 13:51:07,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=1568, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 13:51:07,265 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 151 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:07,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1983 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 13:51:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 13:51:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2024-11-08 13:51:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 158 states have internal predecessors, (173), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-08 13:51:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 220 transitions. [2024-11-08 13:51:07,299 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 220 transitions. Word has length 110 [2024-11-08 13:51:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:07,300 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 220 transitions. [2024-11-08 13:51:07,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.238095238095238) internal successors, (68), 19 states have internal predecessors, (68), 9 states have call successors, (20), 4 states have call predecessors, (20), 7 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2024-11-08 13:51:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 220 transitions. [2024-11-08 13:51:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 13:51:07,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:07,302 INFO L215 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] [2024-11-08 13:51:07,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:51:07,502 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,SelfDestructingSolverStorable2 [2024-11-08 13:51:07,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:07,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1668793987, now seen corresponding path program 1 times [2024-11-08 13:51:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699378845] [2024-11-08 13:51:07,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:09,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:11,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:51:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 13:51:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:51:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:12,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 13:51:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:51:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 13:51:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:51:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:51:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:51:28,514 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:395) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:871) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:795) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:156) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:320) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:371) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:371) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:371) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:371) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:371) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:371) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-08 13:51:28,523 INFO L158 Benchmark]: Toolchain (without parser) took 29647.96ms. Allocated memory was 243.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 213.0MB in the beginning and 827.6MB in the end (delta: -614.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-08 13:51:28,523 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:51:28,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.99ms. Allocated memory is still 243.3MB. Free memory was 212.8MB in the beginning and 194.4MB in the end (delta: 18.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-08 13:51:28,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.33ms. Allocated memory is still 243.3MB. Free memory was 194.4MB in the beginning and 191.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 13:51:28,524 INFO L158 Benchmark]: Boogie Preprocessor took 74.66ms. Allocated memory is still 243.3MB. Free memory was 191.3MB in the beginning and 185.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 13:51:28,524 INFO L158 Benchmark]: RCFGBuilder took 534.89ms. Allocated memory is still 243.3MB. Free memory was 185.0MB in the beginning and 153.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 13:51:28,524 INFO L158 Benchmark]: TraceAbstraction took 28622.11ms. Allocated memory was 243.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 152.5MB in the beginning and 827.6MB in the end (delta: -675.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-08 13:51:28,528 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.99ms. Allocated memory is still 243.3MB. Free memory was 212.8MB in the beginning and 194.4MB in the end (delta: 18.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.33ms. Allocated memory is still 243.3MB. Free memory was 194.4MB in the beginning and 191.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.66ms. Allocated memory is still 243.3MB. Free memory was 191.3MB in the beginning and 185.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 534.89ms. Allocated memory is still 243.3MB. Free memory was 185.0MB in the beginning and 153.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28622.11ms. Allocated memory was 243.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 152.5MB in the beginning and 827.6MB in the end (delta: -675.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-08 13:51:28,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:51:30,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:51:30,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 13:51:30,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:51:30,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:51:30,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:51:30,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:51:30,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:51:30,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:51:30,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:51:30,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:51:30,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:51:30,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:51:30,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:51:30,943 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:51:30,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:51:30,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:51:30,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:51:30,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:51:30,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:51:30,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:51:30,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:51:30,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:51:30,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 13:51:30,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 13:51:30,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:51:30,949 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 13:51:30,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:51:30,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:51:30,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:51:30,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:51:30,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:51:30,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:51:30,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:51:30,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:51:30,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:51:30,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:51:30,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:51:30,950 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 13:51:30,950 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 13:51:30,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:51:30,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:51:30,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:51:30,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:51:30,952 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2024-11-08 13:51:31,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:51:31,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:51:31,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:51:31,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:51:31,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:51:31,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2024-11-08 13:51:32,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:51:32,697 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:51:32,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2024-11-08 13:51:32,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f59d209/076e027277284b9c812aa331dbeacdaa/FLAGb5a251fef [2024-11-08 13:51:33,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f59d209/076e027277284b9c812aa331dbeacdaa [2024-11-08 13:51:33,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:51:33,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:51:33,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:51:33,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:51:33,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:51:33,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101445ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33, skipping insertion in model container [2024-11-08 13:51:33,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:51:33,329 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-2.i[22634,22647] [2024-11-08 13:51:33,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:51:33,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:51:33,416 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-2.i[22634,22647] [2024-11-08 13:51:33,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:51:33,470 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:51:33,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33 WrapperNode [2024-11-08 13:51:33,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:51:33,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:51:33,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:51:33,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:51:33,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,522 INFO L138 Inliner]: procedures = 141, calls = 94, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 232 [2024-11-08 13:51:33,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:51:33,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:51:33,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:51:33,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:51:33,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,569 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]. [2024-11-08 13:51:33,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:51:33,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:51:33,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:51:33,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:51:33,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (1/1) ... [2024-11-08 13:51:33,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:51:33,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:33,644 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) [2024-11-08 13:51:33,653 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 [2024-11-08 13:51:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-08 13:51:33,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-08 13:51:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2024-11-08 13:51:33,690 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2024-11-08 13:51:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:51:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:51:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2024-11-08 13:51:33,690 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2024-11-08 13:51:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:51:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-11-08 13:51:33,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:51:33,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:51:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:51:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2024-11-08 13:51:33,692 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2024-11-08 13:51:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 13:51:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 13:51:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 13:51:33,692 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2024-11-08 13:51:33,693 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2024-11-08 13:51:33,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:51:33,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:51:33,825 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:51:33,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:51:34,206 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-08 13:51:34,207 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:51:34,218 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:51:34,218 INFO L316 CfgBuilder]: Removed 38 assume(true) statements. [2024-11-08 13:51:34,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:51:34 BoogieIcfgContainer [2024-11-08 13:51:34,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:51:34,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:51:34,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:51:34,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:51:34,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:51:33" (1/3) ... [2024-11-08 13:51:34,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59019d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:51:34, skipping insertion in model container [2024-11-08 13:51:34,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:33" (2/3) ... [2024-11-08 13:51:34,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59019d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:51:34, skipping insertion in model container [2024-11-08 13:51:34,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:51:34" (3/3) ... [2024-11-08 13:51:34,226 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2024-11-08 13:51:34,237 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:51:34,237 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:51:34,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:51:34,298 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;@31348556, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:51:34,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:51:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 117 states have internal predecessors, (165), 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) [2024-11-08 13:51:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:51:34,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:34,306 INFO L215 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] [2024-11-08 13:51:34,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2003566147, now seen corresponding path program 1 times [2024-11-08 13:51:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:51:34,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662262903] [2024-11-08 13:51:34,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:34,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:34,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:51:34,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 13:51:34,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 13:51:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:34,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 13:51:34,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:51:34,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:51:34,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:51:34,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662262903] [2024-11-08 13:51:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662262903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:34,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:51:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230070688] [2024-11-08 13:51:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:34,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:51:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:51:34,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:51:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:51:34,505 INFO L87 Difference]: Start difference. First operand has 129 states, 97 states have (on average 1.7010309278350515) internal successors, (165), 117 states have internal predecessors, (165), 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) [2024-11-08 13:51:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:34,541 INFO L93 Difference]: Finished difference Result 253 states and 431 transitions. [2024-11-08 13:51:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:51:34,544 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 [2024-11-08 13:51:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:34,550 INFO L225 Difference]: With dead ends: 253 [2024-11-08 13:51:34,551 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 13:51:34,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:51:34,559 INFO L432 NwaCegarLoop]: 157 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, 157 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 [2024-11-08 13:51:34,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:51:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 13:51:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 13:51:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 109 states have internal predecessors, (116), 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) [2024-11-08 13:51:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2024-11-08 13:51:34,600 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 37 [2024-11-08 13:51:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:34,601 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2024-11-08 13:51:34,601 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) [2024-11-08 13:51:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2024-11-08 13:51:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:51:34,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:34,604 INFO L215 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] [2024-11-08 13:51:34,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 13:51:34,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:34,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:34,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1625779, now seen corresponding path program 1 times [2024-11-08 13:51:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:51:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930863625] [2024-11-08 13:51:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:34,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:34,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:51:34,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 13:51:34,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 13:51:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:34,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 13:51:34,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:51:35,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 13:51:35,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:51:35,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930863625] [2024-11-08 13:51:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930863625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:35,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:35,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2024-11-08 13:51:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106960338] [2024-11-08 13:51:35,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:35,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:51:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:51:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:51:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:51:35,373 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:51:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:35,463 INFO L93 Difference]: Finished difference Result 252 states and 326 transitions. [2024-11-08 13:51:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:51:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2024-11-08 13:51:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:35,465 INFO L225 Difference]: With dead ends: 252 [2024-11-08 13:51:35,465 INFO L226 Difference]: Without dead ends: 134 [2024-11-08 13:51:35,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:51:35,466 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 20 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:35,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 419 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:51:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-08 13:51:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-08 13:51:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 117 states have internal predecessors, (125), 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) [2024-11-08 13:51:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 165 transitions. [2024-11-08 13:51:35,478 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 165 transitions. Word has length 38 [2024-11-08 13:51:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:35,478 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 165 transitions. [2024-11-08 13:51:35,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.5) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:51:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2024-11-08 13:51:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 13:51:35,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:35,480 INFO L215 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] [2024-11-08 13:51:35,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 13:51:35,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:35,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:35,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1497402541, now seen corresponding path program 1 times [2024-11-08 13:51:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:51:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625357716] [2024-11-08 13:51:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:35,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:35,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:51:35,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 13:51:35,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 13:51:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:35,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 13:51:36,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:36,108 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 [2024-11-08 13:51:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 77 proven. 8 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-08 13:51:36,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:37,116 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 [2024-11-08 13:51:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 14 proven. 73 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 13:51:37,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:51:37,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625357716] [2024-11-08 13:51:37,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625357716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:37,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2024-11-08 13:51:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857374769] [2024-11-08 13:51:37,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 13:51:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:51:37,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 13:51:37,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-08 13:51:37,166 INFO L87 Difference]: Start difference. First operand 134 states and 165 transitions. Second operand has 17 states, 16 states have (on average 4.9375) internal successors, (79), 14 states have internal predecessors, (79), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 13:51:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:38,312 INFO L93 Difference]: Finished difference Result 274 states and 344 transitions. [2024-11-08 13:51:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 13:51:38,313 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 14 states have internal predecessors, (79), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 110 [2024-11-08 13:51:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:38,314 INFO L225 Difference]: With dead ends: 274 [2024-11-08 13:51:38,314 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 13:51:38,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2024-11-08 13:51:38,316 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 100 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:38,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 970 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 13:51:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 13:51:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2024-11-08 13:51:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 108 states have (on average 1.2407407407407407) internal successors, (134), 126 states have internal predecessors, (134), 27 states have call successors, (27), 9 states have call predecessors, (27), 8 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-08 13:51:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2024-11-08 13:51:38,335 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 110 [2024-11-08 13:51:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:38,335 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2024-11-08 13:51:38,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.9375) internal successors, (79), 14 states have internal predecessors, (79), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 13:51:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2024-11-08 13:51:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 13:51:38,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:38,341 INFO L215 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] [2024-11-08 13:51:38,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 13:51:38,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:38,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1447704685, now seen corresponding path program 1 times [2024-11-08 13:51:38,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:51:38,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153657260] [2024-11-08 13:51:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:38,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:38,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:51:38,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 13:51:38,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 13:51:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:38,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 13:51:38,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:38,953 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 [2024-11-08 13:51:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-08 13:51:39,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:40,004 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 [2024-11-08 13:51:40,016 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 [2024-11-08 13:51:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-08 13:51:40,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:51:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153657260] [2024-11-08 13:51:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153657260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:40,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:40,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 20 [2024-11-08 13:51:40,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517784201] [2024-11-08 13:51:40,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:40,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 13:51:40,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:51:40,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 13:51:40,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:51:40,090 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 16 states have internal predecessors, (55), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-08 13:51:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:41,589 INFO L93 Difference]: Finished difference Result 303 states and 372 transitions. [2024-11-08 13:51:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 13:51:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 16 states have internal predecessors, (55), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 110 [2024-11-08 13:51:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:41,592 INFO L225 Difference]: With dead ends: 303 [2024-11-08 13:51:41,592 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 13:51:41,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=1058, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 13:51:41,595 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 145 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:41,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1122 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 13:51:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 13:51:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-08 13:51:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 118 states have (on average 1.2203389830508475) internal successors, (144), 136 states have internal predecessors, (144), 29 states have call successors, (29), 11 states have call predecessors, (29), 10 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-08 13:51:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 191 transitions. [2024-11-08 13:51:41,617 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 191 transitions. Word has length 110 [2024-11-08 13:51:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:41,617 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 191 transitions. [2024-11-08 13:51:41,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 16 states have internal predecessors, (55), 8 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-08 13:51:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 191 transitions. [2024-11-08 13:51:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 13:51:41,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:41,621 INFO L215 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] [2024-11-08 13:51:41,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 13:51:41,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:41,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash -818676501, now seen corresponding path program 1 times [2024-11-08 13:51:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:51:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666357285] [2024-11-08 13:51:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:41,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:51:41,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 13:51:41,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 13:51:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:42,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 13:51:42,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:42,190 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 [2024-11-08 13:51:42,230 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 [2024-11-08 13:51:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 13:51:42,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:42,594 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 [2024-11-08 13:51:42,603 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 [2024-11-08 13:51:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 13:51:42,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:51:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666357285] [2024-11-08 13:51:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666357285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:42,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:51:42,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2024-11-08 13:51:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102376053] [2024-11-08 13:51:42,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:42,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 13:51:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:51:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 13:51:42,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-08 13:51:42,728 INFO L87 Difference]: Start difference. First operand 158 states and 191 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 13:51:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:43,709 INFO L93 Difference]: Finished difference Result 269 states and 330 transitions. [2024-11-08 13:51:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 13:51:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 110 [2024-11-08 13:51:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:43,711 INFO L225 Difference]: With dead ends: 269 [2024-11-08 13:51:43,712 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 13:51:43,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:51:43,713 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 77 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:43,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1938 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 13:51:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 13:51:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2024-11-08 13:51:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 158 states have internal predecessors, (173), 29 states have call successors, (29), 12 states have call predecessors, (29), 11 states have return successors, (18), 13 states have call predecessors, (18), 15 states have call successors, (18) [2024-11-08 13:51:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 220 transitions. [2024-11-08 13:51:43,724 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 220 transitions. Word has length 110 [2024-11-08 13:51:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:43,724 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 220 transitions. [2024-11-08 13:51:43,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 13:51:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 220 transitions. [2024-11-08 13:51:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 13:51:43,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:43,726 INFO L215 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] [2024-11-08 13:51:43,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 13:51:43,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:43,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:43,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1668793987, now seen corresponding path program 1 times [2024-11-08 13:51:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:51:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349802500] [2024-11-08 13:51:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:51:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:51:43,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 13:51:43,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 13:51:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:44,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-08 13:51:44,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:44,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-08 13:51:44,737 WARN L873 $PredicateComparison]: unable to prove that (exists ((|##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |##fun~$Pointer$~TO~VOID_alloc_or_die_slave_~ptr~0#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-08 13:51:51,708 INFO L349 Elim1Store]: treesize reduction 413, result has 34.3 percent of original size [2024-11-08 13:51:51,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 85 treesize of output 371