./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:30:43,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:30:43,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:30:43,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:30:43,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:30:43,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:30:43,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:30:43,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:30:43,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:30:43,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:30:43,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:30:43,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:30:43,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:30:43,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:30:43,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:30:43,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:30:43,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:30:43,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:30:43,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:30:43,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:30:43,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:30:43,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:30:43,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:30:43,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:30:43,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:30:43,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:30:43,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:30:43,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:30:43,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:30:43,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:30:43,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:30:43,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:30:43,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:30:43,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:30:43,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:30:43,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:30:43,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:30:43,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:30:43,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:30:43,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:30:43,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:30:43,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:30:43,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c [2024-11-16 19:30:43,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:30:43,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:30:43,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:30:43,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:30:43,687 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:30:43,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-11-16 19:30:45,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:30:45,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:30:45,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-11-16 19:30:45,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c440f85bd/46e484294a0d47fda9e7d665e0d4ef79/FLAG071bc9f54 [2024-11-16 19:30:45,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c440f85bd/46e484294a0d47fda9e7d665e0d4ef79 [2024-11-16 19:30:45,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:30:45,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:30:45,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:30:45,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:30:45,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:30:45,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:30:45" (1/1) ... [2024-11-16 19:30:45,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f01ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:45, skipping insertion in model container [2024-11-16 19:30:45,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:30:45" (1/1) ... [2024-11-16 19:30:45,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:30:46,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-16 19:30:46,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:30:46,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:30:46,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-16 19:30:46,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:30:46,141 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:30:46,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46 WrapperNode [2024-11-16 19:30:46,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:30:46,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:30:46,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:30:46,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:30:46,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,197 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 333 [2024-11-16 19:30:46,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:30:46,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:30:46,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:30:46,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:30:46,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,236 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-16 19:30:46,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:30:46,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:30:46,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:30:46,265 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:30:46,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (1/1) ... [2024-11-16 19:30:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:30:46,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:30:46,298 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-16 19:30:46,300 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-16 19:30:46,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:30:46,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 19:30:46,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 19:30:46,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 19:30:46,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 19:30:46,344 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 19:30:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 19:30:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 19:30:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 19:30:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 19:30:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 19:30:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-16 19:30:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-16 19:30:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:30:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 19:30:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:30:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:30:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 19:30:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:30:46,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:30:46,348 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:30:46,458 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:30:46,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:30:46,931 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:30:46,931 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:30:47,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:30:47,336 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:30:47,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:30:47 BoogieIcfgContainer [2024-11-16 19:30:47,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:30:47,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:30:47,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:30:47,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:30:47,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:30:45" (1/3) ... [2024-11-16 19:30:47,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcb4b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:30:47, skipping insertion in model container [2024-11-16 19:30:47,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:30:46" (2/3) ... [2024-11-16 19:30:47,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fcb4b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:30:47, skipping insertion in model container [2024-11-16 19:30:47,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:30:47" (3/3) ... [2024-11-16 19:30:47,347 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2024-11-16 19:30:47,368 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:30:47,368 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:30:47,369 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:30:47,443 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-16 19:30:47,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 73 transitions, 174 flow [2024-11-16 19:30:47,527 INFO L124 PetriNetUnfolderBase]: 14/69 cut-off events. [2024-11-16 19:30:47,530 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 19:30:47,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 69 events. 14/69 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-11-16 19:30:47,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 73 transitions, 174 flow [2024-11-16 19:30:47,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 68 transitions, 160 flow [2024-11-16 19:30:47,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:30:47,560 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ff0bcf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:30:47,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-16 19:30:47,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:30:47,584 INFO L124 PetriNetUnfolderBase]: 14/67 cut-off events. [2024-11-16 19:30:47,584 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 19:30:47,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:47,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:47,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:30:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 697207867, now seen corresponding path program 1 times [2024-11-16 19:30:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988857492] [2024-11-16 19:30:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:47,858 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-16 19:30:47,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988857492] [2024-11-16 19:30:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988857492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:30:47,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:30:47,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:30:47,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205335997] [2024-11-16 19:30:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:30:47,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:30:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:30:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:30:47,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 73 [2024-11-16 19:30:47,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 160 flow. Second operand has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 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-16 19:30:47,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:47,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 73 [2024-11-16 19:30:47,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:30:48,671 INFO L124 PetriNetUnfolderBase]: 3790/5303 cut-off events. [2024-11-16 19:30:48,671 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-16 19:30:48,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10628 conditions, 5303 events. 3790/5303 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29553 event pairs, 2850 based on Foata normal form. 940/5659 useless extension candidates. Maximal degree in co-relation 9740. Up to 4957 conditions per place. [2024-11-16 19:30:48,725 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 38 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2024-11-16 19:30:48,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 222 flow [2024-11-16 19:30:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:30:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:30:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2024-11-16 19:30:48,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.678082191780822 [2024-11-16 19:30:48,739 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 160 flow. Second operand 2 states and 99 transitions. [2024-11-16 19:30:48,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 222 flow [2024-11-16 19:30:48,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 61 transitions, 206 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-16 19:30:48,761 INFO L231 Difference]: Finished difference. Result has 60 places, 61 transitions, 130 flow [2024-11-16 19:30:48,765 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2024-11-16 19:30:48,770 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, -7 predicate places. [2024-11-16 19:30:48,770 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 130 flow [2024-11-16 19:30:48,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 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-16 19:30:48,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:48,771 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:48,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:30:48,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:30:48,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1631755081, now seen corresponding path program 1 times [2024-11-16 19:30:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517038925] [2024-11-16 19:30:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:30:48,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517038925] [2024-11-16 19:30:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517038925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:30:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:30:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:30:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873749172] [2024-11-16 19:30:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:30:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:30:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:48,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:30:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:30:48,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 73 [2024-11-16 19:30:48,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-16 19:30:48,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:48,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 73 [2024-11-16 19:30:48,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:30:49,928 INFO L124 PetriNetUnfolderBase]: 5629/8452 cut-off events. [2024-11-16 19:30:49,929 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-11-16 19:30:49,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15983 conditions, 8452 events. 5629/8452 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 53195 event pairs, 1634 based on Foata normal form. 1/7705 useless extension candidates. Maximal degree in co-relation 15980. Up to 4718 conditions per place. [2024-11-16 19:30:49,980 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 57 selfloop transitions, 3 changer transitions 1/84 dead transitions. [2024-11-16 19:30:49,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 303 flow [2024-11-16 19:30:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:30:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:30:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-11-16 19:30:49,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6529680365296804 [2024-11-16 19:30:49,983 INFO L175 Difference]: Start difference. First operand has 60 places, 61 transitions, 130 flow. Second operand 3 states and 143 transitions. [2024-11-16 19:30:49,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 303 flow [2024-11-16 19:30:49,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 303 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:30:49,987 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 149 flow [2024-11-16 19:30:49,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-11-16 19:30:49,988 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, -4 predicate places. [2024-11-16 19:30:49,988 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 149 flow [2024-11-16 19:30:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-16 19:30:49,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:49,989 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:49,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:30:49,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:30:49,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 649345, now seen corresponding path program 1 times [2024-11-16 19:30:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:49,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726089212] [2024-11-16 19:30:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:30:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:50,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726089212] [2024-11-16 19:30:50,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726089212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:30:50,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:30:50,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:30:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434870892] [2024-11-16 19:30:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:30:50,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:30:50,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:30:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:30:50,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 73 [2024-11-16 19:30:50,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-16 19:30:50,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:50,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 73 [2024-11-16 19:30:50,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:30:51,270 INFO L124 PetriNetUnfolderBase]: 7551/11644 cut-off events. [2024-11-16 19:30:51,271 INFO L125 PetriNetUnfolderBase]: For 1357/1357 co-relation queries the response was YES. [2024-11-16 19:30:51,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23303 conditions, 11644 events. 7551/11644 cut-off events. For 1357/1357 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 80200 event pairs, 2860 based on Foata normal form. 276/10946 useless extension candidates. Maximal degree in co-relation 23298. Up to 6208 conditions per place. [2024-11-16 19:30:51,356 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 65 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-16 19:30:51,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 351 flow [2024-11-16 19:30:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:30:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:30:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-11-16 19:30:51,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-16 19:30:51,361 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 149 flow. Second operand 3 states and 146 transitions. [2024-11-16 19:30:51,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 351 flow [2024-11-16 19:30:51,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:30:51,365 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 160 flow [2024-11-16 19:30:51,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-11-16 19:30:51,367 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, -2 predicate places. [2024-11-16 19:30:51,368 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 160 flow [2024-11-16 19:30:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-16 19:30:51,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:51,368 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:51,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:30:51,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:30:51,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1783642925, now seen corresponding path program 1 times [2024-11-16 19:30:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387779134] [2024-11-16 19:30:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:30:51,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387779134] [2024-11-16 19:30:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387779134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:30:51,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:30:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:30:51,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663020157] [2024-11-16 19:30:51,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:30:51,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:30:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:51,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:30:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:30:51,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 73 [2024-11-16 19:30:51,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-16 19:30:51,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:51,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 73 [2024-11-16 19:30:51,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:30:53,042 INFO L124 PetriNetUnfolderBase]: 9987/15792 cut-off events. [2024-11-16 19:30:53,042 INFO L125 PetriNetUnfolderBase]: For 3351/3392 co-relation queries the response was YES. [2024-11-16 19:30:53,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32177 conditions, 15792 events. 9987/15792 cut-off events. For 3351/3392 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 116173 event pairs, 3689 based on Foata normal form. 240/14888 useless extension candidates. Maximal degree in co-relation 32171. Up to 8300 conditions per place. [2024-11-16 19:30:53,137 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 65 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-11-16 19:30:53,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 367 flow [2024-11-16 19:30:53,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:30:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:30:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2024-11-16 19:30:53,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6575342465753424 [2024-11-16 19:30:53,142 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 160 flow. Second operand 3 states and 144 transitions. [2024-11-16 19:30:53,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 367 flow [2024-11-16 19:30:53,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:30:53,147 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 172 flow [2024-11-16 19:30:53,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-11-16 19:30:53,148 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places. [2024-11-16 19:30:53,149 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 172 flow [2024-11-16 19:30:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-16 19:30:53,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:53,149 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:30:53,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:30:53,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2083506938, now seen corresponding path program 1 times [2024-11-16 19:30:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:53,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296066464] [2024-11-16 19:30:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:30:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:53,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296066464] [2024-11-16 19:30:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296066464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:30:53,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:30:53,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:30:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189515691] [2024-11-16 19:30:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:30:53,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:30:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:30:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:30:53,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 73 [2024-11-16 19:30:53,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-16 19:30:53,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:53,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 73 [2024-11-16 19:30:53,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:30:55,130 INFO L124 PetriNetUnfolderBase]: 12502/20051 cut-off events. [2024-11-16 19:30:55,130 INFO L125 PetriNetUnfolderBase]: For 5228/5465 co-relation queries the response was YES. [2024-11-16 19:30:55,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42069 conditions, 20051 events. 12502/20051 cut-off events. For 5228/5465 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 154443 event pairs, 10539 based on Foata normal form. 280/18649 useless extension candidates. Maximal degree in co-relation 42062. Up to 13300 conditions per place. [2024-11-16 19:30:55,260 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 81 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2024-11-16 19:30:55,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 457 flow [2024-11-16 19:30:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:30:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:30:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2024-11-16 19:30:55,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5561643835616439 [2024-11-16 19:30:55,262 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 172 flow. Second operand 5 states and 203 transitions. [2024-11-16 19:30:55,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 457 flow [2024-11-16 19:30:55,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:30:55,267 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 222 flow [2024-11-16 19:30:55,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-11-16 19:30:55,269 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 6 predicate places. [2024-11-16 19:30:55,269 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 222 flow [2024-11-16 19:30:55,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-16 19:30:55,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:55,270 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:55,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:30:55,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:30:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:55,271 INFO L85 PathProgramCache]: Analyzing trace with hash 159704766, now seen corresponding path program 1 times [2024-11-16 19:30:55,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:55,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078514804] [2024-11-16 19:30:55,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:30:55,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:55,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078514804] [2024-11-16 19:30:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078514804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:30:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:30:55,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:30:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87591121] [2024-11-16 19:30:55,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:30:55,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:30:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:55,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:30:55,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:30:55,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 73 [2024-11-16 19:30:55,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-16 19:30:55,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:55,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 73 [2024-11-16 19:30:55,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:30:57,452 INFO L124 PetriNetUnfolderBase]: 15702/25666 cut-off events. [2024-11-16 19:30:57,453 INFO L125 PetriNetUnfolderBase]: For 6893/7103 co-relation queries the response was YES. [2024-11-16 19:30:57,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53655 conditions, 25666 events. 15702/25666 cut-off events. For 6893/7103 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 208598 event pairs, 13476 based on Foata normal form. 402/23942 useless extension candidates. Maximal degree in co-relation 53645. Up to 16817 conditions per place. [2024-11-16 19:30:57,614 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 82 selfloop transitions, 6 changer transitions 2/110 dead transitions. [2024-11-16 19:30:57,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 524 flow [2024-11-16 19:30:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:30:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:30:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-11-16 19:30:57,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5397260273972603 [2024-11-16 19:30:57,617 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 222 flow. Second operand 5 states and 197 transitions. [2024-11-16 19:30:57,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 524 flow [2024-11-16 19:30:57,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:30:57,632 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 269 flow [2024-11-16 19:30:57,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2024-11-16 19:30:57,634 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2024-11-16 19:30:57,635 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 269 flow [2024-11-16 19:30:57,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-16 19:30:57,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:30:57,635 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:30:57,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:30:57,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:30:57,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:30:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1605071825, now seen corresponding path program 1 times [2024-11-16 19:30:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:30:57,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771601019] [2024-11-16 19:30:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:30:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:30:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:30:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 19:30:58,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:30:58,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771601019] [2024-11-16 19:30:58,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771601019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:30:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:30:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:30:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728066429] [2024-11-16 19:30:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:30:58,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:30:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:30:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:30:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:30:58,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 73 [2024-11-16 19:30:58,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-16 19:30:58,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:30:58,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 73 [2024-11-16 19:30:58,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:31:01,221 INFO L124 PetriNetUnfolderBase]: 24417/39338 cut-off events. [2024-11-16 19:31:01,221 INFO L125 PetriNetUnfolderBase]: For 11281/11589 co-relation queries the response was YES. [2024-11-16 19:31:01,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83526 conditions, 39338 events. 24417/39338 cut-off events. For 11281/11589 co-relation queries the response was YES. Maximal size of possible extension queue 1508. Compared 329886 event pairs, 19007 based on Foata normal form. 644/37282 useless extension candidates. Maximal degree in co-relation 83513. Up to 25454 conditions per place. [2024-11-16 19:31:01,390 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 96 selfloop transitions, 10 changer transitions 1/126 dead transitions. [2024-11-16 19:31:01,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 126 transitions, 634 flow [2024-11-16 19:31:01,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:31:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:31:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2024-11-16 19:31:01,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4911937377690802 [2024-11-16 19:31:01,392 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 269 flow. Second operand 7 states and 251 transitions. [2024-11-16 19:31:01,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 126 transitions, 634 flow [2024-11-16 19:31:01,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 126 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:31:01,410 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 317 flow [2024-11-16 19:31:01,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2024-11-16 19:31:01,410 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 21 predicate places. [2024-11-16 19:31:01,411 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 317 flow [2024-11-16 19:31:01,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-16 19:31:01,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:31:01,411 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:31:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:31:01,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:31:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:31:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1551334801, now seen corresponding path program 1 times [2024-11-16 19:31:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:31:01,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902847088] [2024-11-16 19:31:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:31:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:31:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:31:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 19:31:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:31:01,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902847088] [2024-11-16 19:31:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902847088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:31:01,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:31:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:31:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609541391] [2024-11-16 19:31:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:31:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:31:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:31:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:31:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:31:01,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 73 [2024-11-16 19:31:01,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-16 19:31:01,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:31:01,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 73 [2024-11-16 19:31:01,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:31:04,378 INFO L124 PetriNetUnfolderBase]: 20294/32266 cut-off events. [2024-11-16 19:31:04,378 INFO L125 PetriNetUnfolderBase]: For 10562/10741 co-relation queries the response was YES. [2024-11-16 19:31:04,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70333 conditions, 32266 events. 20294/32266 cut-off events. For 10562/10741 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 259030 event pairs, 16799 based on Foata normal form. 174/30633 useless extension candidates. Maximal degree in co-relation 70316. Up to 25916 conditions per place. [2024-11-16 19:31:04,536 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 49 selfloop transitions, 6 changer transitions 35/109 dead transitions. [2024-11-16 19:31:04,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 109 transitions, 574 flow [2024-11-16 19:31:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:31:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:31:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 239 transitions. [2024-11-16 19:31:04,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46771037181996084 [2024-11-16 19:31:04,538 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 317 flow. Second operand 7 states and 239 transitions. [2024-11-16 19:31:04,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 109 transitions, 574 flow [2024-11-16 19:31:04,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 109 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:31:04,557 INFO L231 Difference]: Finished difference. Result has 94 places, 74 transitions, 292 flow [2024-11-16 19:31:04,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2024-11-16 19:31:04,558 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 27 predicate places. [2024-11-16 19:31:04,558 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 292 flow [2024-11-16 19:31:04,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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-16 19:31:04,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:31:04,559 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:31:04,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:31:04,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:31:04,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:31:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash 415836933, now seen corresponding path program 1 times [2024-11-16 19:31:04,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:31:04,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205552850] [2024-11-16 19:31:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:31:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:31:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:31:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 19:31:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:31:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205552850] [2024-11-16 19:31:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205552850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:31:04,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:31:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:31:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187752964] [2024-11-16 19:31:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:31:04,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:31:04,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:31:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:31:04,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:31:04,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2024-11-16 19:31:04,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:31:04,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:31:04,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2024-11-16 19:31:04,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:31:06,856 INFO L124 PetriNetUnfolderBase]: 14780/22997 cut-off events. [2024-11-16 19:31:06,856 INFO L125 PetriNetUnfolderBase]: For 9298/9320 co-relation queries the response was YES. [2024-11-16 19:31:06,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52890 conditions, 22997 events. 14780/22997 cut-off events. For 9298/9320 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 169423 event pairs, 2146 based on Foata normal form. 751/23187 useless extension candidates. Maximal degree in co-relation 52871. Up to 14779 conditions per place. [2024-11-16 19:31:06,939 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 81 selfloop transitions, 7 changer transitions 2/113 dead transitions. [2024-11-16 19:31:06,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 588 flow [2024-11-16 19:31:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:31:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:31:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 232 transitions. [2024-11-16 19:31:06,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5296803652968036 [2024-11-16 19:31:06,941 INFO L175 Difference]: Start difference. First operand has 94 places, 74 transitions, 292 flow. Second operand 6 states and 232 transitions. [2024-11-16 19:31:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 588 flow [2024-11-16 19:31:06,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 113 transitions, 558 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-11-16 19:31:06,976 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 274 flow [2024-11-16 19:31:06,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2024-11-16 19:31:06,977 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 19 predicate places. [2024-11-16 19:31:06,977 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 274 flow [2024-11-16 19:31:06,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:31:06,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:31:06,977 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:31:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:31:06,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:31:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:31:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 355641583, now seen corresponding path program 1 times [2024-11-16 19:31:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:31:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367049956] [2024-11-16 19:31:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:31:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:31:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:31:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 19:31:07,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:31:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367049956] [2024-11-16 19:31:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367049956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:31:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:31:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:31:07,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903997346] [2024-11-16 19:31:07,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:31:07,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:31:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:31:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:31:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:31:07,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2024-11-16 19:31:07,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:31:07,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:31:07,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2024-11-16 19:31:07,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:31:08,637 INFO L124 PetriNetUnfolderBase]: 10473/16700 cut-off events. [2024-11-16 19:31:08,638 INFO L125 PetriNetUnfolderBase]: For 9696/10182 co-relation queries the response was YES. [2024-11-16 19:31:08,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38551 conditions, 16700 events. 10473/16700 cut-off events. For 9696/10182 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 121165 event pairs, 1637 based on Foata normal form. 518/16724 useless extension candidates. Maximal degree in co-relation 38536. Up to 10415 conditions per place. [2024-11-16 19:31:08,697 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 85 selfloop transitions, 5 changer transitions 4/116 dead transitions. [2024-11-16 19:31:08,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 116 transitions, 602 flow [2024-11-16 19:31:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:31:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:31:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 234 transitions. [2024-11-16 19:31:08,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5342465753424658 [2024-11-16 19:31:08,699 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 274 flow. Second operand 6 states and 234 transitions. [2024-11-16 19:31:08,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 116 transitions, 602 flow [2024-11-16 19:31:08,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 116 transitions, 568 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-16 19:31:08,709 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 242 flow [2024-11-16 19:31:08,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-11-16 19:31:08,710 INFO L277 CegarLoopForPetriNet]: 67 programPoint places, 17 predicate places. [2024-11-16 19:31:08,710 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 242 flow [2024-11-16 19:31:08,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:31:08,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:31:08,711 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:31:08,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:31:08,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-16 19:31:08,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:31:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash 188083927, now seen corresponding path program 1 times [2024-11-16 19:31:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:31:08,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827560002] [2024-11-16 19:31:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:31:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:31:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:31:08,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:31:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:31:08,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:31:08,875 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:31:08,876 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-16 19:31:08,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-16 19:31:08,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-16 19:31:08,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-16 19:31:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-16 19:31:08,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:31:08,879 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:31:09,013 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:31:09,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:31:09,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:31:09 BasicIcfg [2024-11-16 19:31:09,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:31:09,022 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:31:09,022 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:31:09,022 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:31:09,023 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:30:47" (3/4) ... [2024-11-16 19:31:09,024 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:31:09,144 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:31:09,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:31:09,144 INFO L158 Benchmark]: Toolchain (without parser) took 23357.67ms. Allocated memory was 178.3MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 120.0MB in the beginning and 9.5GB in the end (delta: -9.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-16 19:31:09,145 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 178.3MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:31:09,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.40ms. Allocated memory is still 178.3MB. Free memory was 119.6MB in the beginning and 104.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 19:31:09,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.20ms. Allocated memory is still 178.3MB. Free memory was 104.1MB in the beginning and 101.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:31:09,145 INFO L158 Benchmark]: Boogie Preprocessor took 65.21ms. Allocated memory is still 178.3MB. Free memory was 101.6MB in the beginning and 98.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:31:09,146 INFO L158 Benchmark]: IcfgBuilder took 1072.55ms. Allocated memory was 178.3MB in the beginning and 262.1MB in the end (delta: 83.9MB). Free memory was 98.3MB in the beginning and 190.2MB in the end (delta: -92.0MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2024-11-16 19:31:09,146 INFO L158 Benchmark]: TraceAbstraction took 21680.64ms. Allocated memory was 262.1MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 189.2MB in the beginning and 9.5GB in the end (delta: -9.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-16 19:31:09,146 INFO L158 Benchmark]: Witness Printer took 121.77ms. Allocated memory is still 11.0GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 19:31:09,148 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.20ms. Allocated memory is still 178.3MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.40ms. Allocated memory is still 178.3MB. Free memory was 119.6MB in the beginning and 104.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.20ms. Allocated memory is still 178.3MB. Free memory was 104.1MB in the beginning and 101.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.21ms. Allocated memory is still 178.3MB. Free memory was 101.6MB in the beginning and 98.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1072.55ms. Allocated memory was 178.3MB in the beginning and 262.1MB in the end (delta: 83.9MB). Free memory was 98.3MB in the beginning and 190.2MB in the end (delta: -92.0MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21680.64ms. Allocated memory was 262.1MB in the beginning and 11.0GB in the end (delta: 10.8GB). Free memory was 189.2MB in the beginning and 9.5GB in the end (delta: -9.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 121.77ms. Allocated memory is still 11.0GB. Free memory was 9.5GB in the beginning and 9.5GB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-2:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-2:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) VAL [N=1, \old(size)=1, arr={-2:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-3:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-3:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) VAL [N=1, \old(size)=1, arr={-3:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=0, t2=1, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=0, t2=1, t3=2, total=0] [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L96] COND TRUE 3 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=0] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L114] COND FALSE 4 !(\read(cond)) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L125] 4 return 0; [L82] 2 q2_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L85] 2 cond = j < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L73] COND FALSE 2 !(\read(cond)) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L89] 2 return 0; [L49] 1 _Bool cond = i < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L59] 1 q1_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=1, q2_front=0, total=0] [L66] 1 return 0; [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=6] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=6] [L96] COND FALSE 3 !(\read(cond)) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=6] [L107] 3 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=6] [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=6] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=6] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=6] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=0, t2=1, t3=2, t4=3, total=6] - 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: 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: 148]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 98 locations, 5 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: 21.4s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1199 IncrementalHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 21 mSDtfsCounter, 1199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=7, InterpolantAutomatonStates: 47, 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, 1.9s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 497 ConstructedInterpolants, 0 QuantifiedInterpolants, 1217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 40/40 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 proved your program to be incorrect! [2024-11-16 19:31:09,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE