./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-memsafety/list1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:24:56,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:24:56,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:24:56,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:24:56,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:24:56,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:24:56,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:24:56,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:24:56,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:24:56,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:24:56,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:24:56,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:24:56,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:24:56,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:24:56,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:24:56,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:24:56,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:24:56,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:24:56,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:24:56,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:24:56,538 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:24:56,539 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:24:56,539 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:24:56,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:24:56,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:24:56,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:24:56,540 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:24:56,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:24:56,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:24:56,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:24:56,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:24:56,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:24:56,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:24:56,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:24:56,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:24:56,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:24:56,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:24:56,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:24:56,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:24:56,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:24:56,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:24:56,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:24:56,546 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2024-11-10 18:24:56,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:24:56,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:24:56,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:24:56,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:24:56,861 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:24:56,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-10 18:24:58,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:24:58,868 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:24:58,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-10 18:24:58,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca5ef8e9/0ec7c0bd8ce44939868f2e611730d02e/FLAGeba9dcce1 [2024-11-10 18:24:59,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca5ef8e9/0ec7c0bd8ce44939868f2e611730d02e [2024-11-10 18:24:59,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:24:59,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:24:59,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:24:59,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:24:59,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:24:59,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:24:59,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60700864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59, skipping insertion in model container [2024-11-10 18:24:59,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:24:59,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:24:59,854 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:24:59,872 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:24:59,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:24:59,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:24:59,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:24:59,985 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:24:59,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59 WrapperNode [2024-11-10 18:24:59,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:24:59,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:24:59,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:24:59,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:24:59,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,052 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-11-10 18:25:00,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:25:00,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:25:00,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:25:00,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:25:00,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,100 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [3, 8]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 3 writes are split as follows [1, 2]. [2024-11-10 18:25:00,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:25:00,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:25:00,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:25:00,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:25:00,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (1/1) ... [2024-11-10 18:25:00,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:25:00,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:25:00,176 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-10 18:25:00,182 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-10 18:25:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:25:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-10 18:25:00,238 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-10 18:25:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-10 18:25:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-10 18:25:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:25:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:25:00,241 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:25:00,379 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:25:00,382 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:25:00,536 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc ~#list~0#1.base, ~#list~0#1.offset; [2024-11-10 18:25:00,537 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: SUMMARY for call ULTIMATE.dealloc(~#list~0#1.base, ~#list~0#1.offset); srcloc: null [2024-11-10 18:25:00,662 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:25:00,662 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:25:00,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:25:00,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:25:00,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:25:00 BoogieIcfgContainer [2024-11-10 18:25:00,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:25:00,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:25:00,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:25:00,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:25:00,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:24:59" (1/3) ... [2024-11-10 18:25:00,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3091fb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:25:00, skipping insertion in model container [2024-11-10 18:25:00,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:24:59" (2/3) ... [2024-11-10 18:25:00,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3091fb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:25:00, skipping insertion in model container [2024-11-10 18:25:00,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:25:00" (3/3) ... [2024-11-10 18:25:00,798 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-10 18:25:00,817 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:25:00,817 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-10 18:25:00,817 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:25:00,917 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:25:00,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 168 flow [2024-11-10 18:25:00,990 INFO L124 PetriNetUnfolderBase]: 6/75 cut-off events. [2024-11-10 18:25:00,991 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:25:00,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 228 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2024-11-10 18:25:00,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 168 flow [2024-11-10 18:25:01,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 160 flow [2024-11-10 18:25:01,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:25:01,028 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@55978fec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:25:01,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-10 18:25:01,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:25:01,034 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-10 18:25:01,034 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 18:25:01,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:01,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:25:01,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:01,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash 273542013, now seen corresponding path program 1 times [2024-11-10 18:25:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:01,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175496013] [2024-11-10 18:25:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:01,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175496013] [2024-11-10 18:25:01,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175496013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:01,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:25:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066655202] [2024-11-10 18:25:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:01,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:25:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:25:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:25:01,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 77 [2024-11-10 18:25:01,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:01,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:01,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 77 [2024-11-10 18:25:01,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:01,782 INFO L124 PetriNetUnfolderBase]: 25/176 cut-off events. [2024-11-10 18:25:01,785 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:25:01,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 176 events. 25/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 661 event pairs, 4 based on Foata normal form. 4/132 useless extension candidates. Maximal degree in co-relation 150. Up to 32 conditions per place. [2024-11-10 18:25:01,789 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 30 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-11-10 18:25:01,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 241 flow [2024-11-10 18:25:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:25:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:25:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2024-11-10 18:25:01,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-11-10 18:25:01,807 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 160 flow. Second operand 4 states and 220 transitions. [2024-11-10 18:25:01,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 241 flow [2024-11-10 18:25:01,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 231 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:25:01,820 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 163 flow [2024-11-10 18:25:01,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-11-10 18:25:01,830 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-10 18:25:01,831 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 163 flow [2024-11-10 18:25:01,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:01,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:01,832 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:25:01,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:25:01,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:01,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash 273542014, now seen corresponding path program 1 times [2024-11-10 18:25:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938480240] [2024-11-10 18:25:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:01,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:01,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:01,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938480240] [2024-11-10 18:25:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938480240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:25:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832245967] [2024-11-10 18:25:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:01,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:25:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:01,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:25:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:25:02,076 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 77 [2024-11-10 18:25:02,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:02,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:02,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 77 [2024-11-10 18:25:02,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:02,199 INFO L124 PetriNetUnfolderBase]: 24/171 cut-off events. [2024-11-10 18:25:02,200 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 18:25:02,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 171 events. 24/171 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 634 event pairs, 8 based on Foata normal form. 4/127 useless extension candidates. Maximal degree in co-relation 88. Up to 50 conditions per place. [2024-11-10 18:25:02,204 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 26 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2024-11-10 18:25:02,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 71 transitions, 221 flow [2024-11-10 18:25:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:25:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:25:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2024-11-10 18:25:02,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6948051948051948 [2024-11-10 18:25:02,208 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 163 flow. Second operand 4 states and 214 transitions. [2024-11-10 18:25:02,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 71 transitions, 221 flow [2024-11-10 18:25:02,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:02,214 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 160 flow [2024-11-10 18:25:02,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-11-10 18:25:02,215 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2024-11-10 18:25:02,215 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 160 flow [2024-11-10 18:25:02,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:02,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:02,216 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:25:02,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:25:02,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:02,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash -110131941, now seen corresponding path program 1 times [2024-11-10 18:25:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398942285] [2024-11-10 18:25:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:02,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:02,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398942285] [2024-11-10 18:25:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398942285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:02,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:25:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465072554] [2024-11-10 18:25:02,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:02,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:25:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:02,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:25:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:25:02,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 77 [2024-11-10 18:25:02,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:02,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:02,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 77 [2024-11-10 18:25:02,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:02,483 INFO L124 PetriNetUnfolderBase]: 24/163 cut-off events. [2024-11-10 18:25:02,483 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 18:25:02,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 163 events. 24/163 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 584 event pairs, 12 based on Foata normal form. 4/127 useless extension candidates. Maximal degree in co-relation 161. Up to 54 conditions per place. [2024-11-10 18:25:02,485 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 26 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-10 18:25:02,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 210 flow [2024-11-10 18:25:02,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:25:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:25:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2024-11-10 18:25:02,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7056277056277056 [2024-11-10 18:25:02,492 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 160 flow. Second operand 3 states and 163 transitions. [2024-11-10 18:25:02,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 210 flow [2024-11-10 18:25:02,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:25:02,496 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 150 flow [2024-11-10 18:25:02,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-11-10 18:25:02,497 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2024-11-10 18:25:02,498 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 150 flow [2024-11-10 18:25:02,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:02,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:02,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:25:02,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:25:02,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:02,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash -110131942, now seen corresponding path program 1 times [2024-11-10 18:25:02,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348867015] [2024-11-10 18:25:02,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:02,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348867015] [2024-11-10 18:25:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348867015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:02,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:25:02,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878096261] [2024-11-10 18:25:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:02,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:25:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:25:02,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:25:02,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 77 [2024-11-10 18:25:02,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:02,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:02,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 77 [2024-11-10 18:25:02,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:02,674 INFO L124 PetriNetUnfolderBase]: 26/157 cut-off events. [2024-11-10 18:25:02,674 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 18:25:02,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 157 events. 26/157 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 536 event pairs, 12 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 161. Up to 54 conditions per place. [2024-11-10 18:25:02,676 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 28 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-11-10 18:25:02,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2024-11-10 18:25:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:25:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:25:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-10 18:25:02,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-11-10 18:25:02,678 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 150 flow. Second operand 3 states and 159 transitions. [2024-11-10 18:25:02,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2024-11-10 18:25:02,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:02,681 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 142 flow [2024-11-10 18:25:02,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-11-10 18:25:02,682 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -12 predicate places. [2024-11-10 18:25:02,682 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 142 flow [2024-11-10 18:25:02,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:02,683 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:02,683 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:02,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:25:02,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:02,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -30170811, now seen corresponding path program 1 times [2024-11-10 18:25:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613015751] [2024-11-10 18:25:02,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613015751] [2024-11-10 18:25:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613015751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:02,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:02,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:25:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805974630] [2024-11-10 18:25:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:02,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:25:02,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:02,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:25:02,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:25:03,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 77 [2024-11-10 18:25:03,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 142 flow. Second operand has 9 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:03,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:03,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 77 [2024-11-10 18:25:03,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:03,433 INFO L124 PetriNetUnfolderBase]: 35/182 cut-off events. [2024-11-10 18:25:03,433 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-10 18:25:03,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 182 events. 35/182 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 649 event pairs, 19 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 175. Up to 75 conditions per place. [2024-11-10 18:25:03,438 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 33 selfloop transitions, 11 changer transitions 0/75 dead transitions. [2024-11-10 18:25:03,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 266 flow [2024-11-10 18:25:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:25:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:25:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 494 transitions. [2024-11-10 18:25:03,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415584415584416 [2024-11-10 18:25:03,441 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 142 flow. Second operand 10 states and 494 transitions. [2024-11-10 18:25:03,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 266 flow [2024-11-10 18:25:03,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:03,447 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 213 flow [2024-11-10 18:25:03,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=213, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2024-11-10 18:25:03,448 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2024-11-10 18:25:03,448 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 213 flow [2024-11-10 18:25:03,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:03,450 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:03,450 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:03,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:25:03,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:03,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -36328838, now seen corresponding path program 1 times [2024-11-10 18:25:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565716793] [2024-11-10 18:25:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565716793] [2024-11-10 18:25:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565716793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:25:03,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726157795] [2024-11-10 18:25:03,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:03,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:25:03,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:25:03,924 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-10 18:25:03,926 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-10 18:25:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:04,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 18:25:04,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:04,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:25:04,170 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-10 18:25:04,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-10 18:25:04,192 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 25 treesize of output 13 [2024-11-10 18:25:04,219 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-10 18:25:04,250 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 25 treesize of output 13 [2024-11-10 18:25:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:04,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:25:04,353 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 38 treesize of output 34 [2024-11-10 18:25:04,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:25:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-10 18:25:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:05,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726157795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:25:05,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:25:05,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-10 18:25:05,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832643178] [2024-11-10 18:25:05,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:25:05,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 18:25:05,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:05,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 18:25:05,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:25:06,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-11-10 18:25:06,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 213 flow. Second operand has 16 states, 16 states have (on average 41.75) internal successors, (668), 16 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:06,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:06,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-11-10 18:25:06,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:06,749 INFO L124 PetriNetUnfolderBase]: 35/180 cut-off events. [2024-11-10 18:25:06,749 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-10 18:25:06,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 180 events. 35/180 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 621 event pairs, 5 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 190. Up to 32 conditions per place. [2024-11-10 18:25:06,751 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 39 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2024-11-10 18:25:06,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 332 flow [2024-11-10 18:25:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:25:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:25:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 370 transitions. [2024-11-10 18:25:06,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6006493506493507 [2024-11-10 18:25:06,754 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 213 flow. Second operand 8 states and 370 transitions. [2024-11-10 18:25:06,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 332 flow [2024-11-10 18:25:06,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:06,756 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 228 flow [2024-11-10 18:25:06,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-11-10 18:25:06,757 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2024-11-10 18:25:06,758 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 228 flow [2024-11-10 18:25:06,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 41.75) internal successors, (668), 16 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:06,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:06,759 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:06,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:25:06,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 18:25:06,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:06,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -36328837, now seen corresponding path program 1 times [2024-11-10 18:25:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654686861] [2024-11-10 18:25:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654686861] [2024-11-10 18:25:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654686861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:25:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992664369] [2024-11-10 18:25:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:25:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:25:07,418 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-10 18:25:07,419 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-10 18:25:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:07,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-10 18:25:07,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:07,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 18:25:07,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:25:07,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:25:07,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:25:07,625 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 18:25:07,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 18:25:07,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:25:07,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 18:25:07,719 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 18:25:07,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-10 18:25:07,739 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-10 18:25:07,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 18:25:07,770 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 25 treesize of output 13 [2024-11-10 18:25:07,804 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-10 18:25:07,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 18:25:07,844 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 25 treesize of output 13 [2024-11-10 18:25:07,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 18:25:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:07,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:25:08,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-10 18:25:08,039 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 66 treesize of output 62 [2024-11-10 18:25:08,044 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 102 treesize of output 94 [2024-11-10 18:25:08,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:25:08,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-10 18:25:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:08,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992664369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:25:08,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:25:08,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-10 18:25:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153176843] [2024-11-10 18:25:08,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:25:08,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 18:25:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:08,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 18:25:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-10 18:25:10,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 77 [2024-11-10 18:25:10,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 228 flow. Second operand has 20 states, 20 states have (on average 38.1) internal successors, (762), 20 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:10,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:10,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 77 [2024-11-10 18:25:10,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:10,592 INFO L124 PetriNetUnfolderBase]: 35/178 cut-off events. [2024-11-10 18:25:10,592 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-10 18:25:10,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 178 events. 35/178 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 604 event pairs, 5 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 199. Up to 32 conditions per place. [2024-11-10 18:25:10,595 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 39 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2024-11-10 18:25:10,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 78 transitions, 347 flow [2024-11-10 18:25:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:25:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:25:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2024-11-10 18:25:10,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5487012987012987 [2024-11-10 18:25:10,603 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 228 flow. Second operand 8 states and 338 transitions. [2024-11-10 18:25:10,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 78 transitions, 347 flow [2024-11-10 18:25:10,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 313 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-10 18:25:10,606 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 212 flow [2024-11-10 18:25:10,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=212, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2024-11-10 18:25:10,608 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2024-11-10 18:25:10,608 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 212 flow [2024-11-10 18:25:10,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.1) internal successors, (762), 20 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:10,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:10,609 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:10,625 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-10 18:25:10,809 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,SelfDestructingSolverStorable6 [2024-11-10 18:25:10,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:10,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 834080505, now seen corresponding path program 1 times [2024-11-10 18:25:10,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:10,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701257558] [2024-11-10 18:25:10,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:10,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:25:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701257558] [2024-11-10 18:25:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701257558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:25:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547072906] [2024-11-10 18:25:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:10,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:25:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:25:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:25:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:25:10,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-11-10 18:25:10,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:10,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:10,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-11-10 18:25:10,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:11,052 INFO L124 PetriNetUnfolderBase]: 22/82 cut-off events. [2024-11-10 18:25:11,052 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-10 18:25:11,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 82 events. 22/82 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 14 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 76. Up to 51 conditions per place. [2024-11-10 18:25:11,053 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 27 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2024-11-10 18:25:11,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 38 transitions, 204 flow [2024-11-10 18:25:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:25:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:25:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-11-10 18:25:11,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.587012987012987 [2024-11-10 18:25:11,057 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 212 flow. Second operand 5 states and 226 transitions. [2024-11-10 18:25:11,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 38 transitions, 204 flow [2024-11-10 18:25:11,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 183 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 18:25:11,060 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 127 flow [2024-11-10 18:25:11,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-10 18:25:11,061 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -28 predicate places. [2024-11-10 18:25:11,062 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 127 flow [2024-11-10 18:25:11,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:11,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:11,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:11,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:25:11,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:11,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2062649987, now seen corresponding path program 1 times [2024-11-10 18:25:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:25:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70314597] [2024-11-10 18:25:11,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:11,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:25:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:25:11,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:25:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:25:11,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:25:11,128 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:25:11,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-10 18:25:11,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2024-11-10 18:25:11,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-10 18:25:11,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-10 18:25:11,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-10 18:25:11,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-10 18:25:11,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-10 18:25:11,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-10 18:25:11,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-10 18:25:11,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-10 18:25:11,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-10 18:25:11,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-10 18:25:11,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-10 18:25:11,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-10 18:25:11,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-10 18:25:11,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2024-11-10 18:25:11,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2024-11-10 18:25:11,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-10 18:25:11,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-10 18:25:11,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-10 18:25:11,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-10 18:25:11,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (39 of 61 remaining) [2024-11-10 18:25:11,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-10 18:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2024-11-10 18:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2024-11-10 18:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2024-11-10 18:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2024-11-10 18:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2024-11-10 18:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2024-11-10 18:25:11,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2024-11-10 18:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2024-11-10 18:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2024-11-10 18:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2024-11-10 18:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2024-11-10 18:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2024-11-10 18:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2024-11-10 18:25:11,136 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2024-11-10 18:25:11,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-10 18:25:11,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-10 18:25:11,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-10 18:25:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-10 18:25:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-10 18:25:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-10 18:25:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 61 remaining) [2024-11-10 18:25:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-10 18:25:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2024-11-10 18:25:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2024-11-10 18:25:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2024-11-10 18:25:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2024-11-10 18:25:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2024-11-10 18:25:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2024-11-10 18:25:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2024-11-10 18:25:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2024-11-10 18:25:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2024-11-10 18:25:11,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:25:11,142 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:11,199 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:25:11,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:25:11,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:25:11 BasicIcfg [2024-11-10 18:25:11,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:25:11,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:25:11,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:25:11,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:25:11,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:25:00" (3/4) ... [2024-11-10 18:25:11,231 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:25:11,232 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:25:11,233 INFO L158 Benchmark]: Toolchain (without parser) took 12059.18ms. Allocated memory was 159.4MB in the beginning and 310.4MB in the end (delta: 151.0MB). Free memory was 88.6MB in the beginning and 276.9MB in the end (delta: -188.3MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. [2024-11-10 18:25:11,233 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:25:11,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 811.91ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 114.4MB in the end (delta: -26.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-10 18:25:11,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.71ms. Allocated memory is still 159.4MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:25:11,234 INFO L158 Benchmark]: Boogie Preprocessor took 78.70ms. Allocated memory is still 159.4MB. Free memory was 112.3MB in the beginning and 109.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:25:11,234 INFO L158 Benchmark]: IcfgBuilder took 640.55ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 81.7MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 18:25:11,234 INFO L158 Benchmark]: TraceAbstraction took 10418.27ms. Allocated memory was 159.4MB in the beginning and 310.4MB in the end (delta: 151.0MB). Free memory was 80.8MB in the beginning and 100.2MB in the end (delta: -19.4MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. [2024-11-10 18:25:11,235 INFO L158 Benchmark]: Witness Printer took 26.66ms. Allocated memory is still 310.4MB. Free memory was 100.2MB in the beginning and 276.9MB in the end (delta: -176.6MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-10 18:25:11,238 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.23ms. Allocated memory is still 159.4MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 811.91ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 114.4MB in the end (delta: -26.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.71ms. Allocated memory is still 159.4MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.70ms. Allocated memory is still 159.4MB. Free memory was 112.3MB in the beginning and 109.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 640.55ms. Allocated memory is still 159.4MB. Free memory was 109.6MB in the beginning and 81.7MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10418.27ms. Allocated memory was 159.4MB in the beginning and 310.4MB in the end (delta: 151.0MB). Free memory was 80.8MB in the beginning and 100.2MB in the end (delta: -19.4MB). Peak memory consumption was 132.2MB. Max. memory is 16.1GB. * Witness Printer took 26.66ms. Allocated memory is still 310.4MB. Free memory was 100.2MB in the beginning and 276.9MB in the end (delta: -176.6MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={2:0}, elem={-1:0}, plist={2:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, argc=9, id1=-1, id2=0, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 134 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1435 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 1463 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1411 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5178 IncrementalHoareTripleChecker+Invalid, 5245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 52 mSDtfsCounter, 5178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 10 QuantifiedInterpolants, 1815 SizeOfPredicates, 37 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:25:11,272 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:25:13,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:25:13,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:25:13,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:25:13,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:25:13,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:25:13,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:25:13,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:25:13,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:25:13,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:25:13,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:25:13,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:25:13,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:25:13,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:25:13,829 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:25:13,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:25:13,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:25:13,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:25:13,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:25:13,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:25:13,833 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:25:13,833 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:25:13,833 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:25:13,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:25:13,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:25:13,834 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:25:13,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:25:13,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:25:13,835 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:25:13,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:25:13,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:25:13,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:25:13,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:25:13,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:25:13,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:25:13,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:25:13,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:25:13,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:25:13,840 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:25:13,840 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:25:13,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:25:13,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:25:13,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:25:13,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:25:13,841 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2024-11-10 18:25:14,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:25:14,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:25:14,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:25:14,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:25:14,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:25:14,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-10 18:25:16,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:25:16,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:25:16,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-10 18:25:16,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0f1b238/7712f1894a484f6d8ff810573fb59906/FLAG0d5bfcab0 [2024-11-10 18:25:16,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0f1b238/7712f1894a484f6d8ff810573fb59906 [2024-11-10 18:25:16,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:25:16,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:25:16,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:25:16,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:25:16,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:25:16,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:25:16" (1/1) ... [2024-11-10 18:25:16,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ea1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:16, skipping insertion in model container [2024-11-10 18:25:16,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:25:16" (1/1) ... [2024-11-10 18:25:16,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:25:17,263 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:25:17,275 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:25:17,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:25:17,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:25:17,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:25:17,461 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:25:17,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17 WrapperNode [2024-11-10 18:25:17,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:25:17,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:25:17,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:25:17,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:25:17,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,537 INFO L138 Inliner]: procedures = 265, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-11-10 18:25:17,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:25:17,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:25:17,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:25:17,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:25:17,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,585 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [3, 8]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 3 writes are split as follows [1, 2]. [2024-11-10 18:25:17,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:25:17,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:25:17,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:25:17,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:25:17,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (1/1) ... [2024-11-10 18:25:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:25:17,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:25:17,677 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-10 18:25:17,684 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-10 18:25:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:25:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 18:25:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 18:25:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:25:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 18:25:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 18:25:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:25:17,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:25:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:25:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-10 18:25:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-10 18:25:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-10 18:25:17,744 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-10 18:25:17,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:25:17,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:25:17,747 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:25:17,940 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:25:17,943 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:25:18,215 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048: havoc ~#list~0#1.base, ~#list~0#1.offset; [2024-11-10 18:25:18,216 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: SUMMARY for call ULTIMATE.dealloc(~#list~0#1.base, ~#list~0#1.offset); srcloc: null [2024-11-10 18:25:18,415 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:25:18,416 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:25:18,529 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:25:18,530 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:25:18,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:25:18 BoogieIcfgContainer [2024-11-10 18:25:18,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:25:18,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:25:18,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:25:18,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:25:18,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:25:16" (1/3) ... [2024-11-10 18:25:18,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457d9a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:25:18, skipping insertion in model container [2024-11-10 18:25:18,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:25:17" (2/3) ... [2024-11-10 18:25:18,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457d9a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:25:18, skipping insertion in model container [2024-11-10 18:25:18,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:25:18" (3/3) ... [2024-11-10 18:25:18,540 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-10 18:25:18,558 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:25:18,558 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-10 18:25:18,559 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:25:18,664 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:25:18,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 168 flow [2024-11-10 18:25:18,738 INFO L124 PetriNetUnfolderBase]: 6/75 cut-off events. [2024-11-10 18:25:18,740 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:25:18,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 228 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2024-11-10 18:25:18,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 168 flow [2024-11-10 18:25:18,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 160 flow [2024-11-10 18:25:18,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:25:18,773 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76ec9f5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:25:18,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-10 18:25:18,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:25:18,778 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-10 18:25:18,778 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 18:25:18,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:18,779 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:25:18,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:18,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 273542013, now seen corresponding path program 1 times [2024-11-10 18:25:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:18,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619955618] [2024-11-10 18:25:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:18,799 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-10 18:25:18,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:18,802 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-10 18:25:18,804 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-10 18:25:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:18,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:25:18,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:19,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:25:19,074 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 18:25:19,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 18:25:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:19,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:25:19,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619955618] [2024-11-10 18:25:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619955618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:19,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:19,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:25:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507270965] [2024-11-10 18:25:19,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:19,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:25:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:25:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:25:19,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 77 [2024-11-10 18:25:19,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:19,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:19,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 77 [2024-11-10 18:25:19,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:19,649 INFO L124 PetriNetUnfolderBase]: 25/176 cut-off events. [2024-11-10 18:25:19,650 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 18:25:19,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 176 events. 25/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 661 event pairs, 4 based on Foata normal form. 4/132 useless extension candidates. Maximal degree in co-relation 150. Up to 32 conditions per place. [2024-11-10 18:25:19,656 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 30 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-11-10 18:25:19,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 241 flow [2024-11-10 18:25:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:25:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:25:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2024-11-10 18:25:19,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-11-10 18:25:19,679 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 160 flow. Second operand 4 states and 220 transitions. [2024-11-10 18:25:19,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 241 flow [2024-11-10 18:25:19,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 231 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:25:19,706 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 163 flow [2024-11-10 18:25:19,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-11-10 18:25:19,712 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-10 18:25:19,713 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 163 flow [2024-11-10 18:25:19,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:19,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:19,713 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:25:19,718 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-10 18:25:19,914 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-10 18:25:19,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:19,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 273542014, now seen corresponding path program 1 times [2024-11-10 18:25:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165125617] [2024-11-10 18:25:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:19,917 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-10 18:25:19,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:19,918 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-10 18:25:19,920 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-10 18:25:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:20,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 18:25:20,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:20,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:25:20,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:25:20,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:25:20,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:25:20,157 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:25:20,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:25:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:20,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:25:20,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:20,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165125617] [2024-11-10 18:25:20,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165125617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:20,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:20,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:25:20,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074194818] [2024-11-10 18:25:20,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:20,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:25:20,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:20,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:25:20,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:25:20,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 77 [2024-11-10 18:25:20,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:20,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:20,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 77 [2024-11-10 18:25:20,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:20,524 INFO L124 PetriNetUnfolderBase]: 27/184 cut-off events. [2024-11-10 18:25:20,524 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 18:25:20,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 184 events. 27/184 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 709 event pairs, 4 based on Foata normal form. 4/138 useless extension candidates. Maximal degree in co-relation 88. Up to 43 conditions per place. [2024-11-10 18:25:20,526 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 31 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2024-11-10 18:25:20,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 257 flow [2024-11-10 18:25:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:25:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:25:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2024-11-10 18:25:20,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.724025974025974 [2024-11-10 18:25:20,529 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 163 flow. Second operand 4 states and 223 transitions. [2024-11-10 18:25:20,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 257 flow [2024-11-10 18:25:20,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 79 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:20,532 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 179 flow [2024-11-10 18:25:20,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2024-11-10 18:25:20,533 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2024-11-10 18:25:20,533 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 179 flow [2024-11-10 18:25:20,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:20,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:20,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:25:20,546 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-10 18:25:20,734 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-10 18:25:20,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:20,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash -110131941, now seen corresponding path program 1 times [2024-11-10 18:25:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001179694] [2024-11-10 18:25:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:20,737 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-10 18:25:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:20,740 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-10 18:25:20,749 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-10 18:25:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:20,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:25:20,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:20,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:25:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:20,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:25:20,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001179694] [2024-11-10 18:25:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001179694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:20,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:25:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161936050] [2024-11-10 18:25:20,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:20,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:25:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:25:20,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:25:20,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 77 [2024-11-10 18:25:20,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:20,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:20,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 77 [2024-11-10 18:25:20,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:21,024 INFO L124 PetriNetUnfolderBase]: 26/173 cut-off events. [2024-11-10 18:25:21,024 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 18:25:21,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 173 events. 26/173 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 642 event pairs, 12 based on Foata normal form. 4/137 useless extension candidates. Maximal degree in co-relation 165. Up to 56 conditions per place. [2024-11-10 18:25:21,026 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 26 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2024-11-10 18:25:21,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 231 flow [2024-11-10 18:25:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:25:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:25:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2024-11-10 18:25:21,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7056277056277056 [2024-11-10 18:25:21,029 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 179 flow. Second operand 3 states and 163 transitions. [2024-11-10 18:25:21,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 231 flow [2024-11-10 18:25:21,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:21,031 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 168 flow [2024-11-10 18:25:21,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-11-10 18:25:21,032 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -5 predicate places. [2024-11-10 18:25:21,032 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 168 flow [2024-11-10 18:25:21,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:21,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:21,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:25:21,041 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 (4)] Ended with exit code 0 [2024-11-10 18:25:21,236 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-10 18:25:21,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:21,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash -110131942, now seen corresponding path program 1 times [2024-11-10 18:25:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284719699] [2024-11-10 18:25:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:21,241 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-10 18:25:21,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:21,247 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-10 18:25:21,249 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-10 18:25:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:21,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:25:21,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:21,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:25:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:21,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:25:21,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:21,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284719699] [2024-11-10 18:25:21,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284719699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:21,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:21,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:25:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524028592] [2024-11-10 18:25:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:21,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:25:21,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:21,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:25:21,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:25:21,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 77 [2024-11-10 18:25:21,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:21,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:21,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 77 [2024-11-10 18:25:21,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:21,504 INFO L124 PetriNetUnfolderBase]: 28/165 cut-off events. [2024-11-10 18:25:21,504 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 18:25:21,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 165 events. 28/165 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 583 event pairs, 12 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 161. Up to 56 conditions per place. [2024-11-10 18:25:21,506 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 28 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-11-10 18:25:21,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 224 flow [2024-11-10 18:25:21,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:25:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:25:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-10 18:25:21,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-11-10 18:25:21,508 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 168 flow. Second operand 3 states and 159 transitions. [2024-11-10 18:25:21,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 224 flow [2024-11-10 18:25:21,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:21,510 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 160 flow [2024-11-10 18:25:21,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-10 18:25:21,511 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -9 predicate places. [2024-11-10 18:25:21,512 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 160 flow [2024-11-10 18:25:21,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:21,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:21,512 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:21,516 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-10 18:25:21,712 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-10 18:25:21,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash -30170811, now seen corresponding path program 1 times [2024-11-10 18:25:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527324304] [2024-11-10 18:25:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:21,715 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-10 18:25:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:21,718 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-10 18:25:21,719 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-10 18:25:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:21,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 18:25:21,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:21,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 18:25:21,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 18:25:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:21,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:25:21,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527324304] [2024-11-10 18:25:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527324304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:21,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:21,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:25:21,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186595914] [2024-11-10 18:25:21,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:21,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:25:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:25:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:25:22,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 77 [2024-11-10 18:25:22,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 160 flow. Second operand has 9 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:22,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:22,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 77 [2024-11-10 18:25:22,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:22,688 INFO L124 PetriNetUnfolderBase]: 36/189 cut-off events. [2024-11-10 18:25:22,688 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-10 18:25:22,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 189 events. 36/189 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 697 event pairs, 20 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 175. Up to 78 conditions per place. [2024-11-10 18:25:22,691 INFO L140 encePairwiseOnDemand]: 66/77 looper letters, 34 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2024-11-10 18:25:22,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 77 transitions, 292 flow [2024-11-10 18:25:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:25:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:25:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 494 transitions. [2024-11-10 18:25:22,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415584415584416 [2024-11-10 18:25:22,696 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 160 flow. Second operand 10 states and 494 transitions. [2024-11-10 18:25:22,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 77 transitions, 292 flow [2024-11-10 18:25:22,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 77 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:22,702 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 235 flow [2024-11-10 18:25:22,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=235, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2024-11-10 18:25:22,703 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2024-11-10 18:25:22,703 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 235 flow [2024-11-10 18:25:22,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:22,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:22,704 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:22,712 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 (6)] Ended with exit code 0 [2024-11-10 18:25:22,912 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-10 18:25:22,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -30169691, now seen corresponding path program 1 times [2024-11-10 18:25:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27664040] [2024-11-10 18:25:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:22,914 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-10 18:25:22,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:22,917 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-10 18:25:22,918 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-10 18:25:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:23,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:25:23,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:23,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 18:25:23,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:25:23,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:25:23,079 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:25:23,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:25:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:23,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:25:23,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:23,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27664040] [2024-11-10 18:25:23,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27664040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:25:23,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:25:23,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:25:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282756347] [2024-11-10 18:25:23,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:25:23,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:25:23,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:25:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:25:23,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 77 [2024-11-10 18:25:23,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:23,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:23,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 77 [2024-11-10 18:25:23,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:23,390 INFO L124 PetriNetUnfolderBase]: 33/182 cut-off events. [2024-11-10 18:25:23,390 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-10 18:25:23,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 182 events. 33/182 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 670 event pairs, 8 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 193. Up to 55 conditions per place. [2024-11-10 18:25:23,392 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 31 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2024-11-10 18:25:23,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 315 flow [2024-11-10 18:25:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:25:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:25:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2024-11-10 18:25:23,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2024-11-10 18:25:23,398 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 235 flow. Second operand 5 states and 246 transitions. [2024-11-10 18:25:23,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 73 transitions, 315 flow [2024-11-10 18:25:23,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 73 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:25:23,401 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 244 flow [2024-11-10 18:25:23,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2024-11-10 18:25:23,402 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2024-11-10 18:25:23,402 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 244 flow [2024-11-10 18:25:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:23,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:23,402 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:23,409 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 (7)] Ended with exit code 0 [2024-11-10 18:25:23,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10 18:25:23,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:23,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash -36328838, now seen corresponding path program 1 times [2024-11-10 18:25:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:23,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075644044] [2024-11-10 18:25:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:23,605 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-10 18:25:23,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:23,606 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10 18:25:23,607 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 (8)] Waiting until timeout for monitored process [2024-11-10 18:25:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:23,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 18:25:23,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:23,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:25:23,843 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-10 18:25:23,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 18:25:23,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:25:23,914 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-10 18:25:23,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2024-11-10 18:25:23,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 18:25:24,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:25:24,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-10 18:25:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:24,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:25:24,201 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 36 treesize of output 32 [2024-11-10 18:25:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:28,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:28,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075644044] [2024-11-10 18:25:28,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075644044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:25:28,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:25:28,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-10 18:25:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489837815] [2024-11-10 18:25:28,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:25:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:25:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:25:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:25:33,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:25:33,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 77 [2024-11-10 18:25:33,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 244 flow. Second operand has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:33,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:25:33,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 77 [2024-11-10 18:25:33,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:25:34,085 INFO L124 PetriNetUnfolderBase]: 44/191 cut-off events. [2024-11-10 18:25:34,085 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-11-10 18:25:34,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 191 events. 44/191 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 659 event pairs, 10 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 232. Up to 50 conditions per place. [2024-11-10 18:25:34,088 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 49 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2024-11-10 18:25:34,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 83 transitions, 391 flow [2024-11-10 18:25:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:25:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:25:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 308 transitions. [2024-11-10 18:25:34,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 18:25:34,091 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 244 flow. Second operand 8 states and 308 transitions. [2024-11-10 18:25:34,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 83 transitions, 391 flow [2024-11-10 18:25:34,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 375 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:25:34,096 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 248 flow [2024-11-10 18:25:34,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-11-10 18:25:34,097 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2024-11-10 18:25:34,097 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 248 flow [2024-11-10 18:25:34,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:25:34,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:25:34,098 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:25:34,114 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 (8)] Forceful destruction successful, exit code 0 [2024-11-10 18:25:34,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-10 18:25:34,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:25:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:25:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -36328837, now seen corresponding path program 1 times [2024-11-10 18:25:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:25:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832170065] [2024-11-10 18:25:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:25:34,301 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-10 18:25:34,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:25:34,302 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10 18:25:34,303 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 (9)] Waiting until timeout for monitored process [2024-11-10 18:25:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:25:34,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 18:25:34,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:25:34,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 18:25:34,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 18:25:34,579 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-10 18:25:34,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-10 18:25:34,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 18:25:34,625 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 25 treesize of output 13 [2024-11-10 18:25:34,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 18:25:34,668 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-10 18:25:34,717 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 25 treesize of output 13 [2024-11-10 18:25:34,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 18:25:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:34,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:25:35,150 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 66 treesize of output 62 [2024-11-10 18:25:35,155 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 102 treesize of output 94 [2024-11-10 18:25:35,418 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 40 treesize of output 32 [2024-11-10 18:25:36,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:25:36,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 303 treesize of output 401 [2024-11-10 18:25:37,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:25:37,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 254 treesize of output 518 [2024-11-10 18:25:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:25:41,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:25:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832170065] [2024-11-10 18:25:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832170065] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:25:41,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:25:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-10 18:25:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762703648] [2024-11-10 18:25:41,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:25:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 18:25:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:25:41,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 18:25:41,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-10 18:25:45,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:25:49,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:25:53,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:25:56,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:26:00,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:26:02,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:26:06,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:26:11,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:26:15,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 18:26:18,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 77 [2024-11-10 18:26:18,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 248 flow. Second operand has 16 states, 16 states have (on average 28.6875) internal successors, (459), 16 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:18,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:18,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 77 [2024-11-10 18:26:18,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:20,028 INFO L124 PetriNetUnfolderBase]: 42/187 cut-off events. [2024-11-10 18:26:20,028 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-11-10 18:26:20,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 187 events. 42/187 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 634 event pairs, 10 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 234. Up to 49 conditions per place. [2024-11-10 18:26:20,030 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 45 selfloop transitions, 11 changer transitions 0/81 dead transitions. [2024-11-10 18:26:20,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 81 transitions, 385 flow [2024-11-10 18:26:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:26:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:26:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2024-11-10 18:26:20,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44155844155844154 [2024-11-10 18:26:20,038 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 248 flow. Second operand 8 states and 272 transitions. [2024-11-10 18:26:20,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 81 transitions, 385 flow [2024-11-10 18:26:20,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 350 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-10 18:26:20,048 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 233 flow [2024-11-10 18:26:20,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-11-10 18:26:20,050 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2024-11-10 18:26:20,050 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 233 flow [2024-11-10 18:26:20,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 28.6875) internal successors, (459), 16 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:20,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:20,050 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:20,069 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 (9)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10 18:26:20,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:26:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1563365284, now seen corresponding path program 1 times [2024-11-10 18:26:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274004014] [2024-11-10 18:26:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:20,256 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-10 18:26:20,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:20,259 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10 18:26:20,260 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 (10)] Waiting until timeout for monitored process [2024-11-10 18:26:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:20,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:26:20,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:20,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:26:20,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:26:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274004014] [2024-11-10 18:26:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274004014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:20,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:26:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169721989] [2024-11-10 18:26:20,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:26:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:26:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:26:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:26:20,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-11-10 18:26:20,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:20,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:20,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-11-10 18:26:20,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:20,766 INFO L124 PetriNetUnfolderBase]: 23/85 cut-off events. [2024-11-10 18:26:20,767 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-10 18:26:20,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 85 events. 23/85 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 156 event pairs, 15 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 80. Up to 54 conditions per place. [2024-11-10 18:26:20,768 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 28 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-11-10 18:26:20,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 39 transitions, 227 flow [2024-11-10 18:26:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:26:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:26:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2024-11-10 18:26:20,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.587012987012987 [2024-11-10 18:26:20,770 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 233 flow. Second operand 5 states and 226 transitions. [2024-11-10 18:26:20,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 39 transitions, 227 flow [2024-11-10 18:26:20,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 18:26:20,773 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 145 flow [2024-11-10 18:26:20,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-11-10 18:26:20,774 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2024-11-10 18:26:20,776 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 145 flow [2024-11-10 18:26:20,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:20,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:20,777 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:20,784 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 (10)] Ended with exit code 0 [2024-11-10 18:26:20,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-10 18:26:20,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-10 18:26:20,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2062649987, now seen corresponding path program 1 times [2024-11-10 18:26:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:26:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929050350] [2024-11-10 18:26:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:20,981 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-10 18:26:20,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:26:20,984 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10 18:26:20,989 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 (11)] Waiting until timeout for monitored process [2024-11-10 18:26:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:21,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:26:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:26:21,281 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:26:21,285 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:26:21,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-10 18:26:21,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2024-11-10 18:26:21,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-10 18:26:21,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-10 18:26:21,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-10 18:26:21,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-10 18:26:21,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-10 18:26:21,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-10 18:26:21,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-10 18:26:21,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-10 18:26:21,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-10 18:26:21,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-10 18:26:21,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-10 18:26:21,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-10 18:26:21,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-10 18:26:21,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2024-11-10 18:26:21,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2024-11-10 18:26:21,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-10 18:26:21,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-10 18:26:21,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-10 18:26:21,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (39 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2024-11-10 18:26:21,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2024-11-10 18:26:21,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2024-11-10 18:26:21,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2024-11-10 18:26:21,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2024-11-10 18:26:21,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2024-11-10 18:26:21,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2024-11-10 18:26:21,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-10 18:26:21,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-10 18:26:21,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-10 18:26:21,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-10 18:26:21,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-10 18:26:21,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-10 18:26:21,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-10 18:26:21,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-10 18:26:21,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-10 18:26:21,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-10 18:26:21,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-10 18:26:21,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-10 18:26:21,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-10 18:26:21,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10ASSERT_VIOLATIONMEMORY_FREE (10 of 61 remaining) [2024-11-10 18:26:21,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-10 18:26:21,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2024-11-10 18:26:21,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2024-11-10 18:26:21,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2024-11-10 18:26:21,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2024-11-10 18:26:21,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2024-11-10 18:26:21,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2024-11-10 18:26:21,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2024-11-10 18:26:21,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2024-11-10 18:26:21,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2024-11-10 18:26:21,310 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 (11)] Ended with exit code 0 [2024-11-10 18:26:21,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-10 18:26:21,505 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:21,542 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:26:21,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:26:21,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:26:21 BasicIcfg [2024-11-10 18:26:21,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:26:21,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:26:21,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:26:21,548 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:26:21,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:25:18" (3/4) ... [2024-11-10 18:26:21,551 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:26:21,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:26:21,557 INFO L158 Benchmark]: Toolchain (without parser) took 64894.64ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 94.1MB in the beginning and 100.3MB in the end (delta: -6.2MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-11-10 18:26:21,557 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 73.4MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:21,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 797.44ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 97.4MB in the end (delta: -3.7MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-11-10 18:26:21,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.98ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:26:21,558 INFO L158 Benchmark]: Boogie Preprocessor took 84.32ms. Allocated memory is still 123.7MB. Free memory was 95.3MB in the beginning and 91.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:26:21,558 INFO L158 Benchmark]: IcfgBuilder took 906.80ms. Allocated memory is still 123.7MB. Free memory was 91.9MB in the beginning and 58.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 18:26:21,558 INFO L158 Benchmark]: TraceAbstraction took 63015.11ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 57.6MB in the beginning and 100.3MB in the end (delta: -42.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:21,558 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 163.6MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:26:21,560 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.98ms. Allocated memory is still 73.4MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 797.44ms. Allocated memory is still 123.7MB. Free memory was 93.8MB in the beginning and 97.4MB in the end (delta: -3.7MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.98ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.32ms. Allocated memory is still 123.7MB. Free memory was 95.3MB in the beginning and 91.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 906.80ms. Allocated memory is still 123.7MB. Free memory was 91.9MB in the beginning and 58.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63015.11ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 57.6MB in the beginning and 100.3MB in the end (delta: -42.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 163.6MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=5, \old(argv)={10:9}, argc=5, id1=0, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={7:0}, plist={0:0}] [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={7:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={7:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={7:0}, elem={1:0}, plist={7:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=5, \old(argv)={10:9}, argc=5, id1=0, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=5, \old(argv)={10:9}, \old(plist)={0:0}, argc=5, id1=0, id2=1, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=5, \old(argv)={10:9}, \old(plist)={0:0}, \result={0:0}, argc=5, id1=0, id2=1, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=5, \old(argv)={10:9}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=5, id1=0, id2=1, list={0:0}, list={0:0}, plist={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 134 locations, 61 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 62.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1248 SdHoareTripleChecker+Valid, 45.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 918 SdHoareTripleChecker+Invalid, 44.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 883 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3075 IncrementalHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 35 mSDtfsCounter, 3075 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 122 ConstructedInterpolants, 11 QuantifiedInterpolants, 1636 SizeOfPredicates, 70 NumberOfNonLiveVariables, 746 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 4/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:26:21,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample