./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:26:33,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:26:33,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:26:33,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:26:33,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:26:33,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:26:33,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:26:33,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:26:33,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:26:33,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:26:33,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:26:33,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:26:33,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:26:33,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:26:33,833 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:26:33,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:26:33,834 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:26:33,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:26:33,835 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:26:33,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:26:33,838 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:26:33,840 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:26:33,841 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:26:33,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:26:33,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:26:33,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:26:33,842 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:26:33,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:26:33,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:26:33,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:26:33,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:26:33,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:26:33,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:26:33,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:26:33,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:26:33,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:26:33,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:26:33,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:26:33,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:26:33,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:26:33,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:26:33,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:26:33,847 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2024-11-12 16:26:34,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:26:34,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:26:34,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:26:34,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:26:34,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:26:34,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-12 16:26:35,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:26:35,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:26:35,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-12 16:26:35,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36586dce5/bbfd5ce95b934304a82bffe9c0cd3e5d/FLAG9c642dde1 [2024-11-12 16:26:35,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36586dce5/bbfd5ce95b934304a82bffe9c0cd3e5d [2024-11-12 16:26:35,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:26:35,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:26:35,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:26:35,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:26:35,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:26:35,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:26:35" (1/1) ... [2024-11-12 16:26:35,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da46ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:35, skipping insertion in model container [2024-11-12 16:26:35,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:26:35" (1/1) ... [2024-11-12 16:26:35,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:26:35,967 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 16:26:35,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:26:35,986 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:26:36,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:26:36,044 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:26:36,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36 WrapperNode [2024-11-12 16:26:36,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:26:36,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:26:36,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:26:36,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:26:36,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,095 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 313 [2024-11-12 16:26:36,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:26:36,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:26:36,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:26:36,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:26:36,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,152 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-12 16:26:36,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:26:36,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:26:36,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:26:36,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:26:36,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (1/1) ... [2024-11-12 16:26:36,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:26:36,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:36,219 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-12 16:26:36,225 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-12 16:26:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:26:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 16:26:36,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 16:26:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 16:26:36,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 16:26:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 16:26:36,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 16:26:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-12 16:26:36,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-12 16:26:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:26:36,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:26:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 16:26:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 16:26:36,282 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:26:36,435 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:26:36,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:26:36,915 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:26:36,915 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:26:37,363 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:26:37,363 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 16:26:37,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:37 BoogieIcfgContainer [2024-11-12 16:26:37,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:26:37,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:26:37,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:26:37,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:26:37,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:26:35" (1/3) ... [2024-11-12 16:26:37,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1895755f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:26:37, skipping insertion in model container [2024-11-12 16:26:37,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:26:36" (2/3) ... [2024-11-12 16:26:37,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1895755f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:26:37, skipping insertion in model container [2024-11-12 16:26:37,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:37" (3/3) ... [2024-11-12 16:26:37,397 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-12 16:26:37,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:26:37,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-12 16:26:37,413 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:26:37,491 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-12 16:26:37,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-12 16:26:37,569 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-12 16:26:37,569 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:26:37,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-12 16:26:37,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-12 16:26:37,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-12 16:26:37,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:26:37,598 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;@77a37fee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:26:37,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-12 16:26:37,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:26:37,602 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-12 16:26:37,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:26:37,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:37,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:26:37,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:37,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 892478, now seen corresponding path program 1 times [2024-11-12 16:26:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:37,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889981497] [2024-11-12 16:26:37,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:37,890 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-12 16:26:37,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:37,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889981497] [2024-11-12 16:26:37,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889981497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:37,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:37,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:26:37,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463137966] [2024-11-12 16:26:37,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:37,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:26:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:37,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:26:37,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:26:37,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:37,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-12 16:26:37,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:37,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:37,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:39,719 INFO L124 PetriNetUnfolderBase]: 9651/13484 cut-off events. [2024-11-12 16:26:39,720 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2024-11-12 16:26:39,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26018 conditions, 13484 events. 9651/13484 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88202 event pairs, 6408 based on Foata normal form. 1/7906 useless extension candidates. Maximal degree in co-relation 24428. Up to 11896 conditions per place. [2024-11-12 16:26:39,849 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-12 16:26:39,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-12 16:26:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:26:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:26:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-12 16:26:39,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-12 16:26:39,864 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-12 16:26:39,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-12 16:26:39,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-12 16:26:39,920 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-12 16:26:39,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-11-12 16:26:39,928 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-12 16:26:39,928 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-12 16:26:39,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-12 16:26:39,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:39,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:26:39,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:26:39,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:39,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 892479, now seen corresponding path program 1 times [2024-11-12 16:26:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:39,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962686095] [2024-11-12 16:26:39,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:39,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:40,271 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-12 16:26:40,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:40,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962686095] [2024-11-12 16:26:40,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962686095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:40,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:40,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:26:40,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667119932] [2024-11-12 16:26:40,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:40,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:26:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:40,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:26:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:26:40,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:40,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-12 16:26:40,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:40,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:40,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:41,758 INFO L124 PetriNetUnfolderBase]: 9652/13487 cut-off events. [2024-11-12 16:26:41,759 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-12 16:26:41,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25621 conditions, 13487 events. 9652/13487 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88350 event pairs, 6408 based on Foata normal form. 0/7906 useless extension candidates. Maximal degree in co-relation 25592. Up to 11905 conditions per place. [2024-11-12 16:26:41,840 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-11-12 16:26:41,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 218 flow [2024-11-12 16:26:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:26:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:26:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-12 16:26:41,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-12 16:26:41,842 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 140 transitions. [2024-11-12 16:26:41,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 218 flow [2024-11-12 16:26:41,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:41,845 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2024-11-12 16:26:41,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-11-12 16:26:41,846 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-11-12 16:26:41,846 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2024-11-12 16:26:41,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-12 16:26:41,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:41,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-12 16:26:41,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:26:41,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:41,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash 27668907, now seen corresponding path program 1 times [2024-11-12 16:26:41,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:41,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661186469] [2024-11-12 16:26:41,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:41,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:42,058 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-12 16:26:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661186469] [2024-11-12 16:26:42,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661186469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:42,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:42,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:26:42,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54332086] [2024-11-12 16:26:42,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:42,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:42,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:42,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:42,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:42,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:42,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-12 16:26:42,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:42,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:42,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:43,614 INFO L124 PetriNetUnfolderBase]: 9653/13490 cut-off events. [2024-11-12 16:26:43,614 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-12 16:26:43,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25638 conditions, 13490 events. 9653/13490 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88382 event pairs, 6408 based on Foata normal form. 0/7908 useless extension candidates. Maximal degree in co-relation 25613. Up to 11904 conditions per place. [2024-11-12 16:26:43,737 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-12 16:26:43,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 247 flow [2024-11-12 16:26:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-11-12 16:26:43,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2024-11-12 16:26:43,741 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 167 transitions. [2024-11-12 16:26:43,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 247 flow [2024-11-12 16:26:43,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:43,744 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2024-11-12 16:26:43,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-12 16:26:43,745 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-12 16:26:43,745 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2024-11-12 16:26:43,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-12 16:26:43,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:43,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-12 16:26:43,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:26:43,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash 857701820, now seen corresponding path program 1 times [2024-11-12 16:26:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800099797] [2024-11-12 16:26:43,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:43,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:43,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800099797] [2024-11-12 16:26:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800099797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:43,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766168552] [2024-11-12 16:26:43,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:43,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:43,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:44,000 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-12 16:26:44,002 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-12 16:26:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:44,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:26:44,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:44,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-12 16:26:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:44,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766168552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:44,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-12 16:26:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23432752] [2024-11-12 16:26:44,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:44,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 16:26:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 16:26:44,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:26:44,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:44,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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-12 16:26:44,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:44,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:44,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:46,153 INFO L124 PetriNetUnfolderBase]: 9653/13489 cut-off events. [2024-11-12 16:26:46,153 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-12 16:26:46,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25651 conditions, 13489 events. 9653/13489 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88101 event pairs, 6408 based on Foata normal form. 0/7910 useless extension candidates. Maximal degree in co-relation 25623. Up to 11904 conditions per place. [2024-11-12 16:26:46,266 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-11-12 16:26:46,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 269 flow [2024-11-12 16:26:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:26:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:26:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-11-12 16:26:46,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-11-12 16:26:46,269 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 187 transitions. [2024-11-12 16:26:46,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 269 flow [2024-11-12 16:26:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:46,271 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2024-11-12 16:26:46,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-11-12 16:26:46,272 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-12 16:26:46,273 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2024-11-12 16:26:46,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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-12 16:26:46,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:46,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-12 16:26:46,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 16:26:46,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:46,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:46,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 820044476, now seen corresponding path program 1 times [2024-11-12 16:26:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:46,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772897763] [2024-11-12 16:26:46,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:46,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:46,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:46,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772897763] [2024-11-12 16:26:46,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772897763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:46,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059361152] [2024-11-12 16:26:46,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:46,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:46,654 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-12 16:26:46,656 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-12 16:26:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:46,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:26:46,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:46,764 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-12 16:26:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:46,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:47,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059361152] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:47,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:47,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-12 16:26:47,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060365210] [2024-11-12 16:26:47,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:47,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 16:26:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 16:26:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 16:26:47,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:47,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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-12 16:26:47,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:47,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:47,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:48,133 INFO L124 PetriNetUnfolderBase]: 9653/13488 cut-off events. [2024-11-12 16:26:48,134 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-12 16:26:48,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25655 conditions, 13488 events. 9653/13488 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88257 event pairs, 6408 based on Foata normal form. 0/7910 useless extension candidates. Maximal degree in co-relation 25622. Up to 11896 conditions per place. [2024-11-12 16:26:48,219 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 32 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2024-11-12 16:26:48,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 276 flow [2024-11-12 16:26:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 16:26:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 16:26:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2024-11-12 16:26:48,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2024-11-12 16:26:48,221 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 7 states and 213 transitions. [2024-11-12 16:26:48,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 276 flow [2024-11-12 16:26:48,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 242 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-12 16:26:48,223 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 178 flow [2024-11-12 16:26:48,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-11-12 16:26:48,224 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-12 16:26:48,225 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 178 flow [2024-11-12 16:26:48,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 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-12 16:26:48,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:48,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:48,242 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-12 16:26:48,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:48,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2134544703, now seen corresponding path program 1 times [2024-11-12 16:26:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590215845] [2024-11-12 16:26:48,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:48,523 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-12 16:26:48,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:48,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590215845] [2024-11-12 16:26:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590215845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:48,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:48,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:26:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080397733] [2024-11-12 16:26:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:48,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:26:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:26:48,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:26:48,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-12 16:26:48,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-12 16:26:48,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:48,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-12 16:26:48,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:49,460 INFO L124 PetriNetUnfolderBase]: 10696/14779 cut-off events. [2024-11-12 16:26:49,460 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 16:26:49,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28409 conditions, 14779 events. 10696/14779 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 96591 event pairs, 7188 based on Foata normal form. 298/9032 useless extension candidates. Maximal degree in co-relation 25256. Up to 11905 conditions per place. [2024-11-12 16:26:49,534 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 69 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2024-11-12 16:26:49,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 420 flow [2024-11-12 16:26:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-11-12 16:26:49,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-12 16:26:49,536 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 178 flow. Second operand 5 states and 207 transitions. [2024-11-12 16:26:49,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 420 flow [2024-11-12 16:26:49,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 381 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-12 16:26:49,538 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 192 flow [2024-11-12 16:26:49,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-11-12 16:26:49,538 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-12 16:26:49,538 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 192 flow [2024-11-12 16:26:49,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-12 16:26:49,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:49,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:49,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:26:49,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash -296438428, now seen corresponding path program 1 times [2024-11-12 16:26:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646432893] [2024-11-12 16:26:49,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 16:26:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:49,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646432893] [2024-11-12 16:26:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646432893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:49,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:26:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795813507] [2024-11-12 16:26:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:49,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:26:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:26:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:26:49,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:49,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:26:49,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:49,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:49,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:50,622 INFO L124 PetriNetUnfolderBase]: 7339/10713 cut-off events. [2024-11-12 16:26:50,622 INFO L125 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2024-11-12 16:26:50,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22212 conditions, 10713 events. 7339/10713 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 73007 event pairs, 5000 based on Foata normal form. 0/6785 useless extension candidates. Maximal degree in co-relation 19084. Up to 9261 conditions per place. [2024-11-12 16:26:50,689 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-11-12 16:26:50,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 272 flow [2024-11-12 16:26:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-12 16:26:50,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-11-12 16:26:50,691 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 192 flow. Second operand 5 states and 158 transitions. [2024-11-12 16:26:50,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 272 flow [2024-11-12 16:26:50,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:50,694 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 191 flow [2024-11-12 16:26:50,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-11-12 16:26:50,695 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-12 16:26:50,695 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 191 flow [2024-11-12 16:26:50,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:26:50,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:50,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:50,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:26:50,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:50,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash -296438427, now seen corresponding path program 1 times [2024-11-12 16:26:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800748032] [2024-11-12 16:26:50,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:50,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:50,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800748032] [2024-11-12 16:26:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800748032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:26:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341774707] [2024-11-12 16:26:50,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:50,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:50,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:26:50,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:26:50,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:26:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:51,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 16:26:51,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:26:51,064 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-12 16:26:51,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:26:51,133 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-12 16:26:51,149 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 16:26:51,150 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-12 16:26:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:51,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:26:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341774707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:51,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:26:51,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-12 16:26:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965859714] [2024-11-12 16:26:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:51,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:51,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 16:26:51,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:51,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-12 16:26:51,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:51,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:51,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:51,880 INFO L124 PetriNetUnfolderBase]: 4701/7063 cut-off events. [2024-11-12 16:26:51,880 INFO L125 PetriNetUnfolderBase]: For 804/804 co-relation queries the response was YES. [2024-11-12 16:26:51,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14076 conditions, 7063 events. 4701/7063 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 47471 event pairs, 3256 based on Foata normal form. 0/4989 useless extension candidates. Maximal degree in co-relation 10914. Up to 6049 conditions per place. [2024-11-12 16:26:51,921 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 39 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-12 16:26:51,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 267 flow [2024-11-12 16:26:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:26:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:26:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-12 16:26:51,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-12 16:26:51,923 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 191 flow. Second operand 4 states and 132 transitions. [2024-11-12 16:26:51,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 267 flow [2024-11-12 16:26:51,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:26:51,925 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 180 flow [2024-11-12 16:26:51,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-11-12 16:26:51,926 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2024-11-12 16:26:51,926 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 180 flow [2024-11-12 16:26:51,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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-12 16:26:51,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:51,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:51,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 16:26:52,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:26:52,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:52,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509022, now seen corresponding path program 1 times [2024-11-12 16:26:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:52,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945811493] [2024-11-12 16:26:52,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:52,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945811493] [2024-11-12 16:26:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945811493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:26:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656722360] [2024-11-12 16:26:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:52,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:26:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:26:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:26:52,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:52,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:26:52,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:52,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:52,708 INFO L124 PetriNetUnfolderBase]: 3151/5000 cut-off events. [2024-11-12 16:26:52,708 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-11-12 16:26:52,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 5000 events. 3151/5000 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 33845 event pairs, 2196 based on Foata normal form. 0/3932 useless extension candidates. Maximal degree in co-relation 7627. Up to 4084 conditions per place. [2024-11-12 16:26:52,730 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 36 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-11-12 16:26:52,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 256 flow [2024-11-12 16:26:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:26:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:26:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-12 16:26:52,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-12 16:26:52,731 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 180 flow. Second operand 4 states and 130 transitions. [2024-11-12 16:26:52,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 256 flow [2024-11-12 16:26:52,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:52,732 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 180 flow [2024-11-12 16:26:52,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-12 16:26:52,733 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-11-12 16:26:52,733 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 180 flow [2024-11-12 16:26:52,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:26:52,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:52,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:52,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:26:52,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509023, now seen corresponding path program 1 times [2024-11-12 16:26:52,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896357694] [2024-11-12 16:26:52,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:52,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:52,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896357694] [2024-11-12 16:26:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896357694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:52,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:26:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135048605] [2024-11-12 16:26:52,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:52,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:26:52,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:52,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:26:52,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:26:52,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-12 16:26:52,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-12 16:26:52,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:52,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-12 16:26:52,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:53,231 INFO L124 PetriNetUnfolderBase]: 3669/5895 cut-off events. [2024-11-12 16:26:53,231 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-12 16:26:53,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11668 conditions, 5895 events. 3669/5895 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41164 event pairs, 2627 based on Foata normal form. 128/4903 useless extension candidates. Maximal degree in co-relation 9111. Up to 4094 conditions per place. [2024-11-12 16:26:53,255 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2024-11-12 16:26:53,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 352 flow [2024-11-12 16:26:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:26:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:26:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-11-12 16:26:53,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2024-11-12 16:26:53,256 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 180 flow. Second operand 4 states and 163 transitions. [2024-11-12 16:26:53,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 352 flow [2024-11-12 16:26:53,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:53,258 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 197 flow [2024-11-12 16:26:53,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-12 16:26:53,259 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-12 16:26:53,259 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 197 flow [2024-11-12 16:26:53,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-12 16:26:53,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:53,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:53,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:26:53,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:53,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1396119792, now seen corresponding path program 1 times [2024-11-12 16:26:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:53,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691484354] [2024-11-12 16:26:53,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:53,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:26:53,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:53,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691484354] [2024-11-12 16:26:53,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691484354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:53,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:53,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:26:53,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534297100] [2024-11-12 16:26:53,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:53,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:53,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:53,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-12 16:26:53,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-12 16:26:53,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:53,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-12 16:26:53,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:53,783 INFO L124 PetriNetUnfolderBase]: 2429/4116 cut-off events. [2024-11-12 16:26:53,783 INFO L125 PetriNetUnfolderBase]: For 957/957 co-relation queries the response was YES. [2024-11-12 16:26:53,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8569 conditions, 4116 events. 2429/4116 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 28790 event pairs, 1773 based on Foata normal form. 0/3544 useless extension candidates. Maximal degree in co-relation 6637. Up to 3292 conditions per place. [2024-11-12 16:26:53,800 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 33 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-11-12 16:26:53,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 265 flow [2024-11-12 16:26:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:26:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:26:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-12 16:26:53,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-11-12 16:26:53,801 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 197 flow. Second operand 4 states and 136 transitions. [2024-11-12 16:26:53,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 265 flow [2024-11-12 16:26:53,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:26:53,803 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 195 flow [2024-11-12 16:26:53,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-12 16:26:53,804 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-12 16:26:53,804 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 195 flow [2024-11-12 16:26:53,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-12 16:26:53,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:53,805 INFO L206 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, 1, 1, 1, 1] [2024-11-12 16:26:53,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 16:26:53,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:53,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash 270405486, now seen corresponding path program 1 times [2024-11-12 16:26:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:53,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219725513] [2024-11-12 16:26:53,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219725513] [2024-11-12 16:26:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219725513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:26:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117604800] [2024-11-12 16:26:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:53,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:53,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:53,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:53,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-12 16:26:53,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:53,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:53,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:54,315 INFO L124 PetriNetUnfolderBase]: 2952/4743 cut-off events. [2024-11-12 16:26:54,315 INFO L125 PetriNetUnfolderBase]: For 1127/1127 co-relation queries the response was YES. [2024-11-12 16:26:54,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10275 conditions, 4743 events. 2952/4743 cut-off events. For 1127/1127 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 31457 event pairs, 322 based on Foata normal form. 252/4847 useless extension candidates. Maximal degree in co-relation 8627. Up to 2532 conditions per place. [2024-11-12 16:26:54,336 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 61 selfloop transitions, 5 changer transitions 3/84 dead transitions. [2024-11-12 16:26:54,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 411 flow [2024-11-12 16:26:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:26:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:26:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-11-12 16:26:54,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-12 16:26:54,337 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 195 flow. Second operand 5 states and 182 transitions. [2024-11-12 16:26:54,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 411 flow [2024-11-12 16:26:54,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:54,340 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 179 flow [2024-11-12 16:26:54,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-12 16:26:54,340 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-12 16:26:54,341 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 179 flow [2024-11-12 16:26:54,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 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-12 16:26:54,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:54,341 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:54,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:26:54,341 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:54,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -608167966, now seen corresponding path program 1 times [2024-11-12 16:26:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41325911] [2024-11-12 16:26:54,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 16:26:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:54,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41325911] [2024-11-12 16:26:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41325911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:54,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:54,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:26:54,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724416897] [2024-11-12 16:26:54,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:54,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:54,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:54,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:54,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:54,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-12 16:26:54,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:54,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:54,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:55,043 INFO L124 PetriNetUnfolderBase]: 3929/5758 cut-off events. [2024-11-12 16:26:55,043 INFO L125 PetriNetUnfolderBase]: For 3032/3578 co-relation queries the response was YES. [2024-11-12 16:26:55,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13988 conditions, 5758 events. 3929/5758 cut-off events. For 3032/3578 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 33817 event pairs, 480 based on Foata normal form. 743/6467 useless extension candidates. Maximal degree in co-relation 13960. Up to 3462 conditions per place. [2024-11-12 16:26:55,070 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-11-12 16:26:55,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 459 flow [2024-11-12 16:26:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:26:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:26:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-11-12 16:26:55,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.547979797979798 [2024-11-12 16:26:55,072 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 179 flow. Second operand 6 states and 217 transitions. [2024-11-12 16:26:55,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 459 flow [2024-11-12 16:26:55,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 444 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-12 16:26:55,074 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 227 flow [2024-11-12 16:26:55,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-11-12 16:26:55,075 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-11-12 16:26:55,075 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 227 flow [2024-11-12 16:26:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-12 16:26:55,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:55,076 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:55,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 16:26:55,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:55,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2055308796, now seen corresponding path program 2 times [2024-11-12 16:26:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503655949] [2024-11-12 16:26:55,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:26:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 16:26:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:26:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503655949] [2024-11-12 16:26:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503655949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:26:55,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:26:55,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:26:55,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128064882] [2024-11-12 16:26:55,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:26:55,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:26:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:26:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:26:55,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:26:55,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-12 16:26:55,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:55,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:26:55,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:56,120 INFO L124 PetriNetUnfolderBase]: 7315/11096 cut-off events. [2024-11-12 16:26:56,121 INFO L125 PetriNetUnfolderBase]: For 9679/10225 co-relation queries the response was YES. [2024-11-12 16:26:56,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29238 conditions, 11096 events. 7315/11096 cut-off events. For 9679/10225 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 76167 event pairs, 1649 based on Foata normal form. 699/11500 useless extension candidates. Maximal degree in co-relation 29208. Up to 4207 conditions per place. [2024-11-12 16:26:56,191 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 87 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2024-11-12 16:26:56,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 595 flow [2024-11-12 16:26:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:26:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:26:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2024-11-12 16:26:56,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-11-12 16:26:56,192 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 227 flow. Second operand 6 states and 230 transitions. [2024-11-12 16:26:56,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 595 flow [2024-11-12 16:26:56,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 582 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-12 16:26:56,208 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 301 flow [2024-11-12 16:26:56,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-11-12 16:26:56,209 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2024-11-12 16:26:56,209 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 301 flow [2024-11-12 16:26:56,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-12 16:26:56,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:26:56,209 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:56,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 16:26:56,210 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:26:56,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:26:56,210 INFO L85 PathProgramCache]: Analyzing trace with hash -966993856, now seen corresponding path program 3 times [2024-11-12 16:26:56,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:26:56,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038269011] [2024-11-12 16:26:56,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:26:56,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:26:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:26:56,241 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:26:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:26:56,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:26:56,294 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:26:56,295 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-12 16:26:56,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-12 16:26:56,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-12 16:26:56,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-12 16:26:56,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-12 16:26:56,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-12 16:26:56,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2024-11-12 16:26:56,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2024-11-12 16:26:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2024-11-12 16:26:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-12 16:26:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-12 16:26:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-12 16:26:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-12 16:26:56,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-12 16:26:56,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-12 16:26:56,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-12 16:26:56,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-12 16:26:56,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-12 16:26:56,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2024-11-12 16:26:56,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 16:26:56,303 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:26:56,393 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:26:56,393 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:26:56,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:26:56 BasicIcfg [2024-11-12 16:26:56,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:26:56,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:26:56,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:26:56,398 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:26:56,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:26:37" (3/4) ... [2024-11-12 16:26:56,401 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:26:56,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:26:56,403 INFO L158 Benchmark]: Toolchain (without parser) took 20686.62ms. Allocated memory was 169.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 132.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 707.0MB. Max. memory is 16.1GB. [2024-11-12 16:26:56,403 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:26:56,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.43ms. Allocated memory is still 169.9MB. Free memory was 132.6MB in the beginning and 117.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 16:26:56,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.86ms. Allocated memory is still 169.9MB. Free memory was 117.2MB in the beginning and 114.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:26:56,404 INFO L158 Benchmark]: Boogie Preprocessor took 77.47ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 111.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:26:56,404 INFO L158 Benchmark]: RCFGBuilder took 1188.84ms. Allocated memory is still 169.9MB. Free memory was 111.0MB in the beginning and 127.3MB in the end (delta: -16.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-11-12 16:26:56,404 INFO L158 Benchmark]: TraceAbstraction took 19014.07ms. Allocated memory was 169.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 127.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 701.8MB. Max. memory is 16.1GB. [2024-11-12 16:26:56,404 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:26:56,406 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.43ms. Allocated memory is still 169.9MB. Free memory was 132.6MB in the beginning and 117.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.86ms. Allocated memory is still 169.9MB. Free memory was 117.2MB in the beginning and 114.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.47ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 111.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1188.84ms. Allocated memory is still 169.9MB. Free memory was 111.0MB in the beginning and 127.3MB in the end (delta: -16.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19014.07ms. Allocated memory was 169.9MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 127.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 701.8MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-4:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [L84] 2 return 0; [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [L102] 3 return 0; [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L64] 1 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] CALL 0 reach_error() [L21] 0 __assert_fail("0", "popl20-bad-buffer-mult-alt.wvr.c", 21, __extension__ __PRETTY_FUNCTION__) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=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: 123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 145]: 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: 147]: 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: 144]: 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: 146]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 26 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: 18.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1991 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 21 mSDtfsCounter, 1991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=14, InterpolantAutomatonStates: 68, 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.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 193 ConstructedInterpolants, 1 QuantifiedInterpolants, 1611 SizeOfPredicates, 8 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 37/49 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-12 16:26:56,434 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/weaver/popl20-bad-buffer-mult-alt3.wvr.c -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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:26:58,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:26:58,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 16:26:58,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:26:58,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:26:59,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:26:59,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:26:59,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:26:59,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:26:59,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:26:59,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:26:59,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:26:59,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:26:59,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:26:59,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:26:59,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:26:59,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:26:59,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:26:59,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:26:59,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:26:59,029 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:26:59,030 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:26:59,030 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:26:59,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:26:59,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:26:59,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 16:26:59,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:26:59,032 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 16:26:59,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:26:59,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:26:59,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:26:59,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:26:59,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:26:59,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:26:59,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:26:59,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:26:59,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:26:59,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:26:59,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 16:26:59,036 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 16:26:59,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:26:59,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:26:59,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:26:59,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:26:59,037 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2024-11-12 16:26:59,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:26:59,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:26:59,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:26:59,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:26:59,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:26:59,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-12 16:27:00,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:27:01,140 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:27:01,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-12 16:27:01,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4865416e0/b20afbecf5a640d0a3cc5fdec48da1af/FLAGa81595168 [2024-11-12 16:27:01,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4865416e0/b20afbecf5a640d0a3cc5fdec48da1af [2024-11-12 16:27:01,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:27:01,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:27:01,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:27:01,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:27:01,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:27:01,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3364b7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01, skipping insertion in model container [2024-11-12 16:27:01,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:27:01,483 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 16:27:01,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:27:01,503 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:27:01,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:27:01,572 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:27:01,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01 WrapperNode [2024-11-12 16:27:01,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:27:01,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:27:01,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:27:01,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:27:01,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,634 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 300 [2024-11-12 16:27:01,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:27:01,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:27:01,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:27:01,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:27:01,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,670 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-12 16:27:01,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:27:01,707 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:27:01,707 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:27:01,707 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:27:01,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (1/1) ... [2024-11-12 16:27:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:27:01,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:27:01,733 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-12 16:27:01,735 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-12 16:27:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:27:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 16:27:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 16:27:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 16:27:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 16:27:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 16:27:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 16:27:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 16:27:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 16:27:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 16:27:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 16:27:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-12 16:27:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-12 16:27:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:27:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:27:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:27:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:27:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:27:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 16:27:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 16:27:01,776 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:27:01,897 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:27:01,900 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:27:02,507 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:27:02,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:27:02,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:27:02,908 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 16:27:02,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:27:02 BoogieIcfgContainer [2024-11-12 16:27:02,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:27:02,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:27:02,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:27:02,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:27:02,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:27:01" (1/3) ... [2024-11-12 16:27:02,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f73681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:27:02, skipping insertion in model container [2024-11-12 16:27:02,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:27:01" (2/3) ... [2024-11-12 16:27:02,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f73681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:27:02, skipping insertion in model container [2024-11-12 16:27:02,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:27:02" (3/3) ... [2024-11-12 16:27:02,918 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-12 16:27:02,934 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:27:02,934 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-12 16:27:02,934 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:27:03,019 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-12 16:27:03,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-12 16:27:03,088 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-12 16:27:03,088 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:27:03,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-12 16:27:03,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-12 16:27:03,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-12 16:27:03,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:27:03,116 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;@549318fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:27:03,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-12 16:27:03,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:27:03,120 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-12 16:27:03,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:27:03,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:03,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:27:03,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:03,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash 866650, now seen corresponding path program 1 times [2024-11-12 16:27:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629183885] [2024-11-12 16:27:03,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:03,139 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-12 16:27:03,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:03,142 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-12 16:27:03,165 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-12 16:27:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:03,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:27:03,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:03,321 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-12 16:27:03,337 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-12 16:27:03,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:03,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:03,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629183885] [2024-11-12 16:27:03,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629183885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:03,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:03,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 16:27:03,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445381573] [2024-11-12 16:27:03,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:03,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:27:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:03,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:27:03,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:27:03,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:03,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-12 16:27:03,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:03,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:03,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:05,418 INFO L124 PetriNetUnfolderBase]: 9651/13134 cut-off events. [2024-11-12 16:27:05,418 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-11-12 16:27:05,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25668 conditions, 13134 events. 9651/13134 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82617 event pairs, 6408 based on Foata normal form. 1/7299 useless extension candidates. Maximal degree in co-relation 24078. Up to 11896 conditions per place. [2024-11-12 16:27:05,550 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-12 16:27:05,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-12 16:27:05,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:27:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:27:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-12 16:27:05,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-12 16:27:05,565 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-12 16:27:05,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-12 16:27:05,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-12 16:27:05,592 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-12 16:27:05,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-11-12 16:27:05,598 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-12 16:27:05,599 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-12 16:27:05,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-12 16:27:05,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:05,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-12 16:27:05,604 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-12 16:27:05,800 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-12 16:27:05,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:05,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:05,802 INFO L85 PathProgramCache]: Analyzing trace with hash 866651, now seen corresponding path program 1 times [2024-11-12 16:27:05,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:05,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865407561] [2024-11-12 16:27:05,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:05,803 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-12 16:27:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:05,805 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-12 16:27:05,806 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-12 16:27:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:05,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 16:27:05,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:05,924 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 7 [2024-11-12 16:27:06,021 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-12 16:27:06,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:06,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:06,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865407561] [2024-11-12 16:27:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865407561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:06,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:27:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332437750] [2024-11-12 16:27:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:06,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:06,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-12 16:27:06,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:06,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:06,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:07,744 INFO L124 PetriNetUnfolderBase]: 9653/13140 cut-off events. [2024-11-12 16:27:07,745 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:27:07,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25278 conditions, 13140 events. 9653/13140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82455 event pairs, 6408 based on Foata normal form. 0/7302 useless extension candidates. Maximal degree in co-relation 25242. Up to 11905 conditions per place. [2024-11-12 16:27:07,867 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-12 16:27:07,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 232 flow [2024-11-12 16:27:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:27:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:27:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-11-12 16:27:07,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-12 16:27:07,870 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 144 transitions. [2024-11-12 16:27:07,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 232 flow [2024-11-12 16:27:07,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:27:07,875 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 178 flow [2024-11-12 16:27:07,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2024-11-12 16:27:07,876 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-11-12 16:27:07,879 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 178 flow [2024-11-12 16:27:07,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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-12 16:27:07,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:07,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-12 16:27:07,885 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 (3)] Ended with exit code 0 [2024-11-12 16:27:08,080 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-12 16:27:08,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash 832880270, now seen corresponding path program 1 times [2024-11-12 16:27:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760174814] [2024-11-12 16:27:08,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:08,083 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-12 16:27:08,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:08,089 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-12 16:27:08,091 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-12 16:27:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:08,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 16:27:08,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:08,185 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 7 [2024-11-12 16:27:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:08,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:08,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760174814] [2024-11-12 16:27:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760174814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:08,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-12 16:27:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011838273] [2024-11-12 16:27:08,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:08,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:27:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:27:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:27:08,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:08,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 178 flow. Second operand has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 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-12 16:27:08,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:08,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:08,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:10,871 INFO L124 PetriNetUnfolderBase]: 9659/13158 cut-off events. [2024-11-12 16:27:10,871 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 16:27:10,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25356 conditions, 13158 events. 9659/13158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82550 event pairs, 6408 based on Foata normal form. 0/7318 useless extension candidates. Maximal degree in co-relation 25253. Up to 11908 conditions per place. [2024-11-12 16:27:10,978 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2024-11-12 16:27:10,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 384 flow [2024-11-12 16:27:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:27:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:27:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2024-11-12 16:27:10,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-12 16:27:10,982 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 178 flow. Second operand 10 states and 310 transitions. [2024-11-12 16:27:10,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 384 flow [2024-11-12 16:27:10,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:27:10,987 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 340 flow [2024-11-12 16:27:10,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=340, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-11-12 16:27:10,989 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-12 16:27:10,989 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 340 flow [2024-11-12 16:27:10,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 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-12 16:27:10,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:10,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:10,994 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-12 16:27:11,191 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-12 16:27:11,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:11,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1724412099, now seen corresponding path program 1 times [2024-11-12 16:27:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115914048] [2024-11-12 16:27:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:11,193 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-12 16:27:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:11,195 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-12 16:27:11,196 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-12 16:27:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:11,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 16:27:11,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:11,347 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-12 16:27:11,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:11,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115914048] [2024-11-12 16:27:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115914048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:11,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:27:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806203114] [2024-11-12 16:27:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:11,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:11,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:11,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-12 16:27:11,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-12 16:27:11,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:11,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-12 16:27:11,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:12,424 INFO L124 PetriNetUnfolderBase]: 10705/14769 cut-off events. [2024-11-12 16:27:12,425 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-12 16:27:12,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28518 conditions, 14769 events. 10705/14769 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 95736 event pairs, 7188 based on Foata normal form. 299/8998 useless extension candidates. Maximal degree in co-relation 28430. Up to 11923 conditions per place. [2024-11-12 16:27:12,523 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 98 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2024-11-12 16:27:12,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 700 flow [2024-11-12 16:27:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:27:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:27:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2024-11-12 16:27:12,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2024-11-12 16:27:12,525 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 340 flow. Second operand 4 states and 178 transitions. [2024-11-12 16:27:12,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 700 flow [2024-11-12 16:27:12,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 606 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:12,530 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 295 flow [2024-11-12 16:27:12,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-11-12 16:27:12,531 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-12 16:27:12,531 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 295 flow [2024-11-12 16:27:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-12 16:27:12,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:12,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:12,537 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-12 16:27:12,732 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-12 16:27:12,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289958, now seen corresponding path program 1 times [2024-11-12 16:27:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305768929] [2024-11-12 16:27:12,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:12,734 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-12 16:27:12,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:12,737 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-12 16:27:12,738 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-12 16:27:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:12,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:27:12,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:12,824 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-12 16:27:12,850 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-12 16:27:12,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:12,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305768929] [2024-11-12 16:27:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305768929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:27:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752278950] [2024-11-12 16:27:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:12,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:12,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:27:12,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:12,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:12,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:13,902 INFO L124 PetriNetUnfolderBase]: 7182/10538 cut-off events. [2024-11-12 16:27:13,903 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2024-11-12 16:27:13,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22435 conditions, 10538 events. 7182/10538 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 71537 event pairs, 4852 based on Foata normal form. 0/6695 useless extension candidates. Maximal degree in co-relation 22359. Up to 9010 conditions per place. [2024-11-12 16:27:13,988 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2024-11-12 16:27:13,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 411 flow [2024-11-12 16:27:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:27:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:27:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-12 16:27:13,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-12 16:27:13,990 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 295 flow. Second operand 4 states and 134 transitions. [2024-11-12 16:27:13,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 411 flow [2024-11-12 16:27:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 407 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-12 16:27:13,995 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 299 flow [2024-11-12 16:27:13,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2024-11-12 16:27:13,998 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-12 16:27:13,999 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 299 flow [2024-11-12 16:27:13,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:27:13,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:13,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:14,005 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-12 16:27:14,202 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-12 16:27:14,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:14,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289957, now seen corresponding path program 1 times [2024-11-12 16:27:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:14,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676017363] [2024-11-12 16:27:14,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:14,204 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-12 16:27:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:14,206 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-12 16:27:14,207 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-12 16:27:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:14,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:27:14,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:14,350 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-12 16:27:14,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:14,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676017363] [2024-11-12 16:27:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676017363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:27:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114952064] [2024-11-12 16:27:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:14,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:14,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:14,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-12 16:27:14,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-12 16:27:14,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:14,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-12 16:27:14,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:15,463 INFO L124 PetriNetUnfolderBase]: 8415/12414 cut-off events. [2024-11-12 16:27:15,463 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-11-12 16:27:15,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26771 conditions, 12414 events. 8415/12414 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 87551 event pairs, 5813 based on Foata normal form. 278/8300 useless extension candidates. Maximal degree in co-relation 26693. Up to 9041 conditions per place. [2024-11-12 16:27:15,534 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 77 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2024-11-12 16:27:15,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 535 flow [2024-11-12 16:27:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:27:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:27:15,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2024-11-12 16:27:15,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2024-11-12 16:27:15,536 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 299 flow. Second operand 4 states and 171 transitions. [2024-11-12 16:27:15,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 535 flow [2024-11-12 16:27:15,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 520 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:27:15,541 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 307 flow [2024-11-12 16:27:15,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-11-12 16:27:15,542 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2024-11-12 16:27:15,542 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 307 flow [2024-11-12 16:27:15,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-12 16:27:15,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:15,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:15,546 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-12 16:27:15,743 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-12 16:27:15,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash -417123471, now seen corresponding path program 1 times [2024-11-12 16:27:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335331210] [2024-11-12 16:27:15,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:15,744 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-12 16:27:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:15,747 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-12 16:27:15,748 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-12 16:27:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:15,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 16:27:15,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:15,862 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 7 [2024-11-12 16:27:15,886 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-12 16:27:16,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:27:16,056 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 16 treesize of output 11 [2024-11-12 16:27:16,075 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:27:16,075 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-12 16:27:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:16,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:17,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:17,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335331210] [2024-11-12 16:27:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335331210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:17,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-12 16:27:17,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147807980] [2024-11-12 16:27:17,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:17,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:27:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:17,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:27:17,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:27:17,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-11-12 16:27:17,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 307 flow. Second operand has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 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-12 16:27:17,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:17,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-11-12 16:27:17,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:24,341 INFO L124 PetriNetUnfolderBase]: 18393/27640 cut-off events. [2024-11-12 16:27:24,341 INFO L125 PetriNetUnfolderBase]: For 5198/5198 co-relation queries the response was YES. [2024-11-12 16:27:24,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63602 conditions, 27640 events. 18393/27640 cut-off events. For 5198/5198 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 215219 event pairs, 12645 based on Foata normal form. 0/19455 useless extension candidates. Maximal degree in co-relation 43495. Up to 9616 conditions per place. [2024-11-12 16:27:24,549 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 107 selfloop transitions, 46 changer transitions 0/170 dead transitions. [2024-11-12 16:27:24,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 170 transitions, 979 flow [2024-11-12 16:27:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 16:27:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 16:27:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 433 transitions. [2024-11-12 16:27:24,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4686147186147186 [2024-11-12 16:27:24,553 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 307 flow. Second operand 14 states and 433 transitions. [2024-11-12 16:27:24,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 170 transitions, 979 flow [2024-11-12 16:27:24,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 170 transitions, 970 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:27:24,565 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 618 flow [2024-11-12 16:27:24,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=618, PETRI_PLACES=94, PETRI_TRANSITIONS=105} [2024-11-12 16:27:24,566 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-11-12 16:27:24,566 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 618 flow [2024-11-12 16:27:24,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 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-12 16:27:24,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:24,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:24,571 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 (8)] Ended with exit code 0 [2024-11-12 16:27:24,767 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-12 16:27:24,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -417123472, now seen corresponding path program 1 times [2024-11-12 16:27:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:24,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174004480] [2024-11-12 16:27:24,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:24,769 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-12 16:27:24,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:24,772 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-12 16:27:24,772 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-12 16:27:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:24,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:27:24,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:24,847 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-12 16:27:24,870 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-12 16:27:24,871 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-12 16:27:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:27:24,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:24,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174004480] [2024-11-12 16:27:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174004480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:24,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:24,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:27:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400405319] [2024-11-12 16:27:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:24,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:24,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 618 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:27:24,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:24,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:24,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:26,188 INFO L124 PetriNetUnfolderBase]: 11532/18365 cut-off events. [2024-11-12 16:27:26,189 INFO L125 PetriNetUnfolderBase]: For 9067/9067 co-relation queries the response was YES. [2024-11-12 16:27:26,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42288 conditions, 18365 events. 11532/18365 cut-off events. For 9067/9067 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 145004 event pairs, 8046 based on Foata normal form. 0/14951 useless extension candidates. Maximal degree in co-relation 34726. Up to 14950 conditions per place. [2024-11-12 16:27:26,349 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 69 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2024-11-12 16:27:26,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 778 flow [2024-11-12 16:27:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:27:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:27:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-12 16:27:26,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-11-12 16:27:26,350 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 618 flow. Second operand 5 states and 156 transitions. [2024-11-12 16:27:26,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 103 transitions, 778 flow [2024-11-12 16:27:26,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:27:26,371 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 637 flow [2024-11-12 16:27:26,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=637, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2024-11-12 16:27:26,372 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 27 predicate places. [2024-11-12 16:27:26,372 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 637 flow [2024-11-12 16:27:26,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:27:26,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:26,372 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-12 16:27:26,377 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-12 16:27:26,573 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-12 16:27:26,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:26,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash -913765977, now seen corresponding path program 2 times [2024-11-12 16:27:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913480591] [2024-11-12 16:27:26,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:27:26,574 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-12 16:27:26,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:26,575 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-12 16:27:26,577 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-12 16:27:26,638 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:27:26,638 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:27:26,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 16:27:26,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:26,653 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 7 [2024-11-12 16:27:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:26,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:27,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913480591] [2024-11-12 16:27:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913480591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:27,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:27,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-12 16:27:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946663002] [2024-11-12 16:27:27,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:27,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 16:27:27,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:27,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 16:27:27,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-12 16:27:27,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:27,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 637 flow. Second operand has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 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-12 16:27:27,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:27,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:27,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:30,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 16:27:32,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 16:27:38,043 INFO L124 PetriNetUnfolderBase]: 11562/18455 cut-off events. [2024-11-12 16:27:38,043 INFO L125 PetriNetUnfolderBase]: For 9255/9255 co-relation queries the response was YES. [2024-11-12 16:27:38,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42787 conditions, 18455 events. 11562/18455 cut-off events. For 9255/9255 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 145996 event pairs, 8046 based on Foata normal form. 30/15071 useless extension candidates. Maximal degree in co-relation 35119. Up to 14995 conditions per place. [2024-11-12 16:27:38,188 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 107 changer transitions 0/163 dead transitions. [2024-11-12 16:27:38,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 163 transitions, 1421 flow [2024-11-12 16:27:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:27:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-12 16:27:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 636 transitions. [2024-11-12 16:27:38,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2024-11-12 16:27:38,191 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 637 flow. Second operand 22 states and 636 transitions. [2024-11-12 16:27:38,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 163 transitions, 1421 flow [2024-11-12 16:27:38,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 1382 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:27:38,209 INFO L231 Difference]: Finished difference. Result has 119 places, 163 transitions, 1394 flow [2024-11-12 16:27:38,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1394, PETRI_PLACES=119, PETRI_TRANSITIONS=163} [2024-11-12 16:27:38,210 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2024-11-12 16:27:38,210 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 163 transitions, 1394 flow [2024-11-12 16:27:38,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 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-12 16:27:38,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:38,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:38,214 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 (10)] Forceful destruction successful, exit code 0 [2024-11-12 16:27:38,411 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-12 16:27:38,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:38,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1036105231, now seen corresponding path program 1 times [2024-11-12 16:27:38,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:38,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161522397] [2024-11-12 16:27:38,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:27:38,413 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-12 16:27:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:38,416 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-12 16:27:38,417 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-12 16:27:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:27:38,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 16:27:38,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:38,511 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 7 [2024-11-12 16:27:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:38,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:27:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:27:39,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161522397] [2024-11-12 16:27:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161522397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:27:39,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:27:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-12 16:27:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691389129] [2024-11-12 16:27:39,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:27:39,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 16:27:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:39,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 16:27:39,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 16:27:39,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:39,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 163 transitions, 1394 flow. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 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-12 16:27:39,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:39,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:39,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:44,345 INFO L124 PetriNetUnfolderBase]: 23510/36119 cut-off events. [2024-11-12 16:27:44,346 INFO L125 PetriNetUnfolderBase]: For 19453/19453 co-relation queries the response was YES. [2024-11-12 16:27:44,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84310 conditions, 36119 events. 23510/36119 cut-off events. For 19453/19453 co-relation queries the response was YES. Maximal size of possible extension queue 1854. Compared 295942 event pairs, 16270 based on Foata normal form. 0/30315 useless extension candidates. Maximal degree in co-relation 84067. Up to 12598 conditions per place. [2024-11-12 16:27:44,810 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 118 selfloop transitions, 100 changer transitions 0/235 dead transitions. [2024-11-12 16:27:44,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 235 transitions, 2054 flow [2024-11-12 16:27:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 16:27:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 16:27:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 363 transitions. [2024-11-12 16:27:44,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-12 16:27:44,813 INFO L175 Difference]: Start difference. First operand has 119 places, 163 transitions, 1394 flow. Second operand 10 states and 363 transitions. [2024-11-12 16:27:44,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 235 transitions, 2054 flow [2024-11-12 16:27:44,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 235 transitions, 1774 flow, removed 87 selfloop flow, removed 9 redundant places. [2024-11-12 16:27:44,847 INFO L231 Difference]: Finished difference. Result has 121 places, 163 transitions, 1327 flow [2024-11-12 16:27:44,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=121, PETRI_TRANSITIONS=163} [2024-11-12 16:27:44,847 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 53 predicate places. [2024-11-12 16:27:44,848 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 163 transitions, 1327 flow [2024-11-12 16:27:44,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 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-12 16:27:44,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:44,848 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:44,852 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 (11)] Forceful destruction successful, exit code 0 [2024-11-12 16:27:45,049 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-12 16:27:45,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:45,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1008799752, now seen corresponding path program 2 times [2024-11-12 16:27:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262103839] [2024-11-12 16:27:45,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:27:45,050 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-12 16:27:45,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:45,054 INFO L229 MonitoredProcess]: Starting monitored process 12 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-12 16:27:45,055 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 (12)] Waiting until timeout for monitored process [2024-11-12 16:27:45,126 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 16:27:45,126 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:27:45,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 16:27:45,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:45,138 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-12 16:27:45,144 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 7 [2024-11-12 16:27:45,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 16:27:45,254 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 16 treesize of output 11 [2024-11-12 16:27:45,263 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 16:27:45,264 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-12 16:27:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 16:27:45,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:45,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262103839] [2024-11-12 16:27:45,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262103839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:45,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:45,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:27:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581397362] [2024-11-12 16:27:45,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:45,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:45,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-12 16:27:45,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 163 transitions, 1327 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:27:45,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:45,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-12 16:27:45,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:27:48,649 INFO L124 PetriNetUnfolderBase]: 19251/30868 cut-off events. [2024-11-12 16:27:48,649 INFO L125 PetriNetUnfolderBase]: For 24505/24505 co-relation queries the response was YES. [2024-11-12 16:27:48,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69759 conditions, 30868 events. 19251/30868 cut-off events. For 24505/24505 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 262575 event pairs, 13413 based on Foata normal form. 1039/27585 useless extension candidates. Maximal degree in co-relation 69528. Up to 25203 conditions per place. [2024-11-12 16:27:48,916 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 130 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2024-11-12 16:27:48,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 161 transitions, 1595 flow [2024-11-12 16:27:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:27:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:27:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-12 16:27:48,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-12 16:27:48,918 INFO L175 Difference]: Start difference. First operand has 121 places, 163 transitions, 1327 flow. Second operand 4 states and 130 transitions. [2024-11-12 16:27:48,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 161 transitions, 1595 flow [2024-11-12 16:27:48,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 1527 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:27:48,951 INFO L231 Difference]: Finished difference. Result has 118 places, 161 transitions, 1267 flow [2024-11-12 16:27:48,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1267, PETRI_PLACES=118, PETRI_TRANSITIONS=161} [2024-11-12 16:27:48,952 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2024-11-12 16:27:48,952 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 1267 flow [2024-11-12 16:27:48,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-12 16:27:48,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:27:48,953 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:27:48,957 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 (12)] Ended with exit code 0 [2024-11-12 16:27:49,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-12 16:27:49,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 16:27:49,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:27:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1073675981, now seen corresponding path program 2 times [2024-11-12 16:27:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:27:49,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905603430] [2024-11-12 16:27:49,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:27:49,155 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-12 16:27:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:27:49,156 INFO L229 MonitoredProcess]: Starting monitored process 13 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-12 16:27:49,157 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 (13)] Waiting until timeout for monitored process [2024-11-12 16:27:49,237 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 16:27:49,237 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:27:49,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:27:49,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:27:49,258 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 7 [2024-11-12 16:27:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 16:27:49,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:27:49,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:27:49,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905603430] [2024-11-12 16:27:49,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905603430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:27:49,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:27:49,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:27:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301225518] [2024-11-12 16:27:49,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:27:49,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:27:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:27:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:27:49,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:27:49,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-12 16:27:49,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 1267 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-12 16:27:49,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:27:49,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-12 16:27:49,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand