./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/weaver/chl-node-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:37:16,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:37:16,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:37:16,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:37:16,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:37:16,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:37:16,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:37:16,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:37:16,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:37:16,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:37:16,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:37:16,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:37:16,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:37:16,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:37:16,975 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:37:16,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:37:16,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:37:16,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:37:16,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:37:16,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:37:16,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:37:16,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:37:16,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:37:16,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:37:16,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:37:16,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:37:16,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:37:16,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:37:16,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:37:16,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:37:16,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:37:16,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:37:16,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:37:16,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:37:16,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:37:16,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:37:16,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:37:16,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:37:16,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:37:16,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:37:16,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:37:16,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:37:16,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:37:16,982 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2024-06-27 16:37:17,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:37:17,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:37:17,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:37:17,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:37:17,217 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:37:17,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2024-06-27 16:37:18,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:37:18,265 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:37:18,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2024-06-27 16:37:18,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1039f7e/bc8f7eb7f0b54989873ad4ff7e52ab0c/FLAG490354b46 [2024-06-27 16:37:18,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb1039f7e/bc8f7eb7f0b54989873ad4ff7e52ab0c [2024-06-27 16:37:18,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:37:18,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:37:18,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:37:18,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:37:18,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:37:18,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18, skipping insertion in model container [2024-06-27 16:37:18,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,309 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:37:18,427 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c[4035,4048] [2024-06-27 16:37:18,440 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:37:18,446 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:37:18,517 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c[4035,4048] [2024-06-27 16:37:18,529 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:37:18,556 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:37:18,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18 WrapperNode [2024-06-27 16:37:18,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:37:18,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:37:18,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:37:18,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:37:18,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,622 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 424 [2024-06-27 16:37:18,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:37:18,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:37:18,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:37:18,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:37:18,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,648 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2024-06-27 16:37:18,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:37:18,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:37:18,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:37:18,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:37:18,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (1/1) ... [2024-06-27 16:37:18,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:37:18,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:37:18,753 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-06-27 16:37:18,779 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-06-27 16:37:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:37:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:37:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:37:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 16:37:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:37:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:37:18,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 16:37:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:37:18,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:37:18,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:37:18,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:37:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:37:18,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:37:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:37:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:37:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 16:37:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:37:18,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:37:18,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:37:18,816 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:37:18,918 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:37:18,919 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:37:19,270 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:37:19,271 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:37:19,652 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:37:19,653 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:37:19,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:37:19 BoogieIcfgContainer [2024-06-27 16:37:19,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:37:19,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:37:19,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:37:19,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:37:19,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:37:18" (1/3) ... [2024-06-27 16:37:19,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d97ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:37:19, skipping insertion in model container [2024-06-27 16:37:19,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:37:18" (2/3) ... [2024-06-27 16:37:19,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d97ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:37:19, skipping insertion in model container [2024-06-27 16:37:19,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:37:19" (3/3) ... [2024-06-27 16:37:19,664 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2024-06-27 16:37:19,671 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:37:19,677 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:37:19,677 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:37:19,677 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:37:19,786 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:37:19,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:37:19,851 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-06-27 16:37:19,853 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:37:19,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-06-27 16:37:19,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:37:19,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2024-06-27 16:37:19,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:37:19,871 INFO L357 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, mHoare=true, 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;@1936aae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:37:19,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:37:19,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:37:19,887 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2024-06-27 16:37:19,887 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:37:19,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:19,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:19,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:19,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1832792802, now seen corresponding path program 1 times [2024-06-27 16:37:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835311452] [2024-06-27 16:37:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:37:20,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:20,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835311452] [2024-06-27 16:37:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835311452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:37:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608506655] [2024-06-27 16:37:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:20,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:37:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:20,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:37:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:37:20,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:20,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-06-27 16:37:20,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:20,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:20,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:20,477 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2024-06-27 16:37:20,478 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 16:37:20,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 83 events. 38/83 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2024-06-27 16:37:20,481 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-06-27 16:37:20,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2024-06-27 16:37:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:37:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:37:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-06-27 16:37:20,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-27 16:37:20,492 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 40 transitions. [2024-06-27 16:37:20,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2024-06-27 16:37:20,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:37:20,496 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2024-06-27 16:37:20,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2024-06-27 16:37:20,501 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-06-27 16:37:20,501 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2024-06-27 16:37:20,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-06-27 16:37:20,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:20,502 INFO L208 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] [2024-06-27 16:37:20,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:37:20,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:20,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1211915053, now seen corresponding path program 1 times [2024-06-27 16:37:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:20,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935111155] [2024-06-27 16:37:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:37:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935111155] [2024-06-27 16:37:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935111155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:37:20,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237272115] [2024-06-27 16:37:20,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:20,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:20,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:20,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:20,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:20,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-06-27 16:37:20,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:20,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:20,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:20,814 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2024-06-27 16:37:20,815 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:37:20,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 84 events. 38/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 81 conditions per place. [2024-06-27 16:37:20,817 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2024-06-27 16:37:20,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2024-06-27 16:37:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-06-27 16:37:20,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-27 16:37:20,820 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 4 states and 45 transitions. [2024-06-27 16:37:20,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2024-06-27 16:37:20,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:20,824 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 86 flow [2024-06-27 16:37:20,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-06-27 16:37:20,825 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-06-27 16:37:20,826 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 86 flow [2024-06-27 16:37:20,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-06-27 16:37:20,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:20,826 INFO L208 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] [2024-06-27 16:37:20,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:37:20,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:20,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1038909340, now seen corresponding path program 1 times [2024-06-27 16:37:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023915724] [2024-06-27 16:37:20,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:37:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:20,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023915724] [2024-06-27 16:37:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023915724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:20,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:37:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954294513] [2024-06-27 16:37:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:20,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:20,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:20,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:20,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:20,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06-27 16:37:20,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:20,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:20,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:21,051 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2024-06-27 16:37:21,052 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:37:21,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 85 events. 38/85 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 172. Up to 82 conditions per place. [2024-06-27 16:37:21,053 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 25 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2024-06-27 16:37:21,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 146 flow [2024-06-27 16:37:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-06-27 16:37:21,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-27 16:37:21,054 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 86 flow. Second operand 4 states and 45 transitions. [2024-06-27 16:37:21,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 146 flow [2024-06-27 16:37:21,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:21,055 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 103 flow [2024-06-27 16:37:21,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2024-06-27 16:37:21,056 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-27 16:37:21,056 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 103 flow [2024-06-27 16:37:21,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06-27 16:37:21,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:21,057 INFO L208 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] [2024-06-27 16:37:21,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:37:21,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:21,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1091596161, now seen corresponding path program 1 times [2024-06-27 16:37:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699766318] [2024-06-27 16:37:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:37:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699766318] [2024-06-27 16:37:21,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699766318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:37:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505938193] [2024-06-27 16:37:21,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:21,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:21,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:21,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:21,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:21,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-06-27 16:37:21,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:21,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:21,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:21,218 INFO L124 PetriNetUnfolderBase]: 38/86 cut-off events. [2024-06-27 16:37:21,218 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:37:21,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 86 events. 38/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 179. Up to 84 conditions per place. [2024-06-27 16:37:21,219 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-27 16:37:21,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 165 flow [2024-06-27 16:37:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 16:37:21,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-27 16:37:21,221 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 103 flow. Second operand 4 states and 44 transitions. [2024-06-27 16:37:21,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 165 flow [2024-06-27 16:37:21,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:37:21,222 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2024-06-27 16:37:21,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2024-06-27 16:37:21,223 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-06-27 16:37:21,223 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2024-06-27 16:37:21,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-06-27 16:37:21,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:21,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:21,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:37:21,224 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:21,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1484568796, now seen corresponding path program 1 times [2024-06-27 16:37:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993078446] [2024-06-27 16:37:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:37:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993078446] [2024-06-27 16:37:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993078446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:21,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:37:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020396119] [2024-06-27 16:37:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:21,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:21,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:21,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06-27 16:37:21,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:21,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:21,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:21,410 INFO L124 PetriNetUnfolderBase]: 38/87 cut-off events. [2024-06-27 16:37:21,410 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:37:21,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 87 events. 38/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 185. Up to 85 conditions per place. [2024-06-27 16:37:21,412 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-06-27 16:37:21,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 177 flow [2024-06-27 16:37:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 16:37:21,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-27 16:37:21,414 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 113 flow. Second operand 4 states and 44 transitions. [2024-06-27 16:37:21,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 177 flow [2024-06-27 16:37:21,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:37:21,417 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 121 flow [2024-06-27 16:37:21,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-27 16:37:21,422 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-27 16:37:21,422 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 121 flow [2024-06-27 16:37:21,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06-27 16:37:21,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:21,423 INFO L208 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] [2024-06-27 16:37:21,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:37:21,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:21,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash 667979527, now seen corresponding path program 1 times [2024-06-27 16:37:21,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:21,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307189749] [2024-06-27 16:37:21,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:21,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 16:37:21,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:21,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307189749] [2024-06-27 16:37:21,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307189749] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:37:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262646785] [2024-06-27 16:37:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:21,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:37:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:21,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:37:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:37:21,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:21,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-06-27 16:37:21,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:21,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:21,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:21,597 INFO L124 PetriNetUnfolderBase]: 38/88 cut-off events. [2024-06-27 16:37:21,598 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 16:37:21,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 88 events. 38/88 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 32 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 190. Up to 86 conditions per place. [2024-06-27 16:37:21,599 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2024-06-27 16:37:21,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 187 flow [2024-06-27 16:37:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:37:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:37:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 16:37:21,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-27 16:37:21,600 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 121 flow. Second operand 4 states and 44 transitions. [2024-06-27 16:37:21,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 187 flow [2024-06-27 16:37:21,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 181 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:37:21,601 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 129 flow [2024-06-27 16:37:21,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2024-06-27 16:37:21,602 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-27 16:37:21,602 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 129 flow [2024-06-27 16:37:21,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-06-27 16:37:21,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:21,603 INFO L208 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] [2024-06-27 16:37:21,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:37:21,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:21,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1966291484, now seen corresponding path program 1 times [2024-06-27 16:37:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122755052] [2024-06-27 16:37:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:37:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:24,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122755052] [2024-06-27 16:37:24,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122755052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:24,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:24,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:37:24,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719626760] [2024-06-27 16:37:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:24,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:24,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:24,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:24,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:24,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:24,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:24,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:24,310 INFO L124 PetriNetUnfolderBase]: 39/107 cut-off events. [2024-06-27 16:37:24,311 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-27 16:37:24,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 107 events. 39/107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 284 event pairs, 7 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 231. Up to 39 conditions per place. [2024-06-27 16:37:24,311 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 40 selfloop transitions, 4 changer transitions 7/52 dead transitions. [2024-06-27 16:37:24,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 278 flow [2024-06-27 16:37:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:37:24,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:37:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-27 16:37:24,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054 [2024-06-27 16:37:24,313 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 129 flow. Second operand 6 states and 70 transitions. [2024-06-27 16:37:24,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 278 flow [2024-06-27 16:37:24,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 272 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:37:24,314 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 142 flow [2024-06-27 16:37:24,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2024-06-27 16:37:24,315 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-27 16:37:24,315 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 142 flow [2024-06-27 16:37:24,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:24,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:24,316 INFO L208 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] [2024-06-27 16:37:24,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:37:24,316 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:24,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1611634074, now seen corresponding path program 2 times [2024-06-27 16:37:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:24,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92733246] [2024-06-27 16:37:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:24,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:37:26,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92733246] [2024-06-27 16:37:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92733246] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:26,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:26,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:37:26,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960374754] [2024-06-27 16:37:26,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:26,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:26,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:26,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:26,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:26,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:26,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:26,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:26,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:26,275 INFO L124 PetriNetUnfolderBase]: 35/112 cut-off events. [2024-06-27 16:37:26,275 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-06-27 16:37:26,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 112 events. 35/112 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 303 event pairs, 10 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 297. Up to 44 conditions per place. [2024-06-27 16:37:26,277 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 39 selfloop transitions, 5 changer transitions 5/50 dead transitions. [2024-06-27 16:37:26,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 290 flow [2024-06-27 16:37:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:37:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:37:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-06-27 16:37:26,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409 [2024-06-27 16:37:26,279 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 142 flow. Second operand 6 states and 67 transitions. [2024-06-27 16:37:26,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 290 flow [2024-06-27 16:37:26,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 279 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 16:37:26,282 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 159 flow [2024-06-27 16:37:26,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2024-06-27 16:37:26,284 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2024-06-27 16:37:26,284 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 159 flow [2024-06-27 16:37:26,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:26,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:26,285 INFO L208 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] [2024-06-27 16:37:26,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:37:26,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:26,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash -600203812, now seen corresponding path program 3 times [2024-06-27 16:37:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591773223] [2024-06-27 16:37:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:26,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:37:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591773223] [2024-06-27 16:37:27,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591773223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:27,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:27,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:37:27,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754726024] [2024-06-27 16:37:27,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:27,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:27,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:27,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:27,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:27,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:27,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:27,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:27,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:27,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:27,916 INFO L124 PetriNetUnfolderBase]: 35/115 cut-off events. [2024-06-27 16:37:27,916 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-06-27 16:37:27,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 115 events. 35/115 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 354 event pairs, 8 based on Foata normal form. 1/116 useless extension candidates. Maximal degree in co-relation 355. Up to 50 conditions per place. [2024-06-27 16:37:27,919 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 38 selfloop transitions, 4 changer transitions 9/52 dead transitions. [2024-06-27 16:37:27,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 322 flow [2024-06-27 16:37:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:37:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:37:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2024-06-27 16:37:27,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-27 16:37:27,923 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 159 flow. Second operand 6 states and 68 transitions. [2024-06-27 16:37:27,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 322 flow [2024-06-27 16:37:27,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 307 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-27 16:37:27,926 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 166 flow [2024-06-27 16:37:27,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2024-06-27 16:37:27,927 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-27 16:37:27,927 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 166 flow [2024-06-27 16:37:27,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:27,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:27,927 INFO L208 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] [2024-06-27 16:37:27,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:37:27,928 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:27,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 494017660, now seen corresponding path program 4 times [2024-06-27 16:37:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377224699] [2024-06-27 16:37:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:37:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377224699] [2024-06-27 16:37:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377224699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:29,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:29,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:37:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55112841] [2024-06-27 16:37:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:29,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:29,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:29,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:29,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:29,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:29,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:29,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:29,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:29,527 INFO L124 PetriNetUnfolderBase]: 30/98 cut-off events. [2024-06-27 16:37:29,527 INFO L125 PetriNetUnfolderBase]: For 257/257 co-relation queries the response was YES. [2024-06-27 16:37:29,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 98 events. 30/98 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 226 event pairs, 15 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 334. Up to 55 conditions per place. [2024-06-27 16:37:29,528 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 38 selfloop transitions, 5 changer transitions 7/51 dead transitions. [2024-06-27 16:37:29,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 334 flow [2024-06-27 16:37:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:37:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:37:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-27 16:37:29,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-27 16:37:29,530 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 166 flow. Second operand 6 states and 66 transitions. [2024-06-27 16:37:29,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 334 flow [2024-06-27 16:37:29,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 311 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 16:37:29,531 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 173 flow [2024-06-27 16:37:29,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2024-06-27 16:37:29,532 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-27 16:37:29,532 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 173 flow [2024-06-27 16:37:29,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:29,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:29,532 INFO L208 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] [2024-06-27 16:37:29,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 16:37:29,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:29,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1025750212, now seen corresponding path program 5 times [2024-06-27 16:37:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852525094] [2024-06-27 16:37:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:31,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 16:37:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852525094] [2024-06-27 16:37:31,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852525094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:37:31,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:37:31,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 16:37:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581741785] [2024-06-27 16:37:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:37:31,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 16:37:31,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 16:37:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:37:31,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:37:31,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:31,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:31,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:37:31,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:31,593 INFO L124 PetriNetUnfolderBase]: 24/77 cut-off events. [2024-06-27 16:37:31,594 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-06-27 16:37:31,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 77 events. 24/77 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 7 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 278. Up to 36 conditions per place. [2024-06-27 16:37:31,594 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 31 selfloop transitions, 3 changer transitions 14/49 dead transitions. [2024-06-27 16:37:31,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 311 flow [2024-06-27 16:37:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 16:37:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 16:37:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2024-06-27 16:37:31,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-27 16:37:31,596 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 173 flow. Second operand 6 states and 66 transitions. [2024-06-27 16:37:31,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 311 flow [2024-06-27 16:37:31,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 295 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 16:37:31,598 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 152 flow [2024-06-27 16:37:31,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2024-06-27 16:37:31,598 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-27 16:37:31,598 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 152 flow [2024-06-27 16:37:31,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-06-27 16:37:31,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:31,599 INFO L208 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] [2024-06-27 16:37:31,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:37:31,599 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:37:31,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash -143211830, now seen corresponding path program 6 times [2024-06-27 16:37:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227488696] [2024-06-27 16:37:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:37:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227488696] [2024-06-27 16:37:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227488696] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:37:33,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758703731] [2024-06-27 16:37:33,977 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 16:37:33,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:33,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:37:33,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:37:34,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 16:37:34,205 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-06-27 16:37:34,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:34,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 22 conjunts are in the unsatisfiable core [2024-06-27 16:37:34,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:44,821 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 1262 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:37:44,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:37:44,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 1624 treesize of output 4576 [2024-06-27 16:37:55,852 WARN L293 SmtUtils]: Spent 10.84s on a formula simplification that was a NOOP. DAG size: 1241 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:37:55,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:37:55,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 728 treesize of output 3582 [2024-06-27 16:50:38,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-06-27 16:50:38,206 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 16:50:38,207 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 16:50:38,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 16:50:38,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-06-27 16:50:38,418 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 76 more [2024-06-27 16:50:38,439 INFO L158 Benchmark]: Toolchain (without parser) took 800156.15ms. Allocated memory was 163.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 93.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 998.3MB. Max. memory is 16.1GB. [2024-06-27 16:50:38,439 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:50:38,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.22ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 133.6MB in the end (delta: -40.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-06-27 16:50:38,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.23ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 130.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 16:50:38,440 INFO L158 Benchmark]: Boogie Preprocessor took 73.94ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 126.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 16:50:38,443 INFO L158 Benchmark]: RCFGBuilder took 956.34ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 57.8MB in the end (delta: 68.3MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-06-27 16:50:38,443 INFO L158 Benchmark]: TraceAbstraction took 798782.18ms. Allocated memory was 163.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 57.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 960.8MB. Max. memory is 16.1GB. [2024-06-27 16:50:38,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.22ms. Allocated memory is still 163.6MB. Free memory was 93.7MB in the beginning and 133.6MB in the end (delta: -40.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.23ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 130.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.94ms. Allocated memory is still 163.6MB. Free memory was 130.3MB in the beginning and 126.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 956.34ms. Allocated memory is still 163.6MB. Free memory was 126.1MB in the beginning and 57.8MB in the end (delta: 68.3MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * TraceAbstraction took 798782.18ms. Allocated memory was 163.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 57.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 960.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:50:40,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:50:40,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 16:50:40,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:50:40,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:50:40,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:50:40,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:50:40,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:50:40,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:50:40,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:50:40,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:50:40,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:50:40,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:50:40,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:50:40,494 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:50:40,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:50:40,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:50:40,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:50:40,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:50:40,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:50:40,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:50:40,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:50:40,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:50:40,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 16:50:40,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 16:50:40,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:50:40,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 16:50:40,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:50:40,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:50:40,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:50:40,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:50:40,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:50:40,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:50:40,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:50:40,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:50:40,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:50:40,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:50:40,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:50:40,500 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 16:50:40,501 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 16:50:40,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:50:40,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:50:40,501 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:50:40,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:50:40,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:50:40,502 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 16:50:40,502 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2024-06-27 16:50:40,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:50:40,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:50:40,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:50:40,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:50:40,773 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:50:40,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2024-06-27 16:50:42,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:50:42,199 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:50:42,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c [2024-06-27 16:50:42,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844b235c5/6be854c5e2fe49f593976c74ab67a0c5/FLAG6a0911fed [2024-06-27 16:50:42,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844b235c5/6be854c5e2fe49f593976c74ab67a0c5 [2024-06-27 16:50:42,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:50:42,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:50:42,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:50:42,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:50:42,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:50:42,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f79af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42, skipping insertion in model container [2024-06-27 16:50:42,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,255 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:50:42,398 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c[4035,4048] [2024-06-27 16:50:42,409 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:50:42,431 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 16:50:42,437 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:50:42,465 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c[4035,4048] [2024-06-27 16:50:42,471 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:50:42,482 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:50:42,509 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-subst.wvr.c[4035,4048] [2024-06-27 16:50:42,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:50:42,540 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:50:42,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42 WrapperNode [2024-06-27 16:50:42,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:50:42,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:50:42,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:50:42,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:50:42,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,607 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2024-06-27 16:50:42,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:50:42,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:50:42,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:50:42,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:50:42,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,664 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2024-06-27 16:50:42,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:50:42,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:50:42,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:50:42,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:50:42,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (1/1) ... [2024-06-27 16:50:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:50:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:50:42,758 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-06-27 16:50:42,804 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-06-27 16:50:42,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:50:42,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 16:50:42,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-06-27 16:50:42,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:50:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:50:42,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:50:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:50:42,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:50:42,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:50:42,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:50:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:50:42,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:50:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-06-27 16:50:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-06-27 16:50:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-06-27 16:50:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 16:50:42,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 16:50:42,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-06-27 16:50:42,846 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 16:50:42,940 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:50:42,941 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:50:43,469 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:50:43,470 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:50:43,931 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:50:43,931 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:50:43,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:50:43 BoogieIcfgContainer [2024-06-27 16:50:43,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:50:43,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:50:43,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:50:43,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:50:43,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:50:42" (1/3) ... [2024-06-27 16:50:43,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bf5391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:50:43, skipping insertion in model container [2024-06-27 16:50:43,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:50:42" (2/3) ... [2024-06-27 16:50:43,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bf5391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:50:43, skipping insertion in model container [2024-06-27 16:50:43,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:50:43" (3/3) ... [2024-06-27 16:50:43,947 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2024-06-27 16:50:43,954 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:50:43,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:50:43,961 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:50:43,961 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:50:44,024 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 16:50:44,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:50:44,096 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2024-06-27 16:50:44,096 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:50:44,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-06-27 16:50:44,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2024-06-27 16:50:44,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2024-06-27 16:50:44,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:50:44,112 INFO L357 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, mHoare=true, 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;@6d1e49de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:50:44,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 16:50:44,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:50:44,122 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2024-06-27 16:50:44,122 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:50:44,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:44,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:44,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:50:44,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1716681090, now seen corresponding path program 1 times [2024-06-27 16:50:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:50:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747213757] [2024-06-27 16:50:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:44,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:44,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:50:44,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:50:44,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-27 16:50:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:44,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:50:44,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:50:44,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:50:44,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:50:44,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747213757] [2024-06-27 16:50:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747213757] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:50:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:50:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:50:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538215451] [2024-06-27 16:50:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:50:44,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:50:44,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:50:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:50:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:50:44,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:50:44,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-06-27 16:50:44,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:44,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:50:44,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:44,533 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2024-06-27 16:50:44,533 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 16:50:44,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 83 events. 38/83 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2024-06-27 16:50:44,535 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2024-06-27 16:50:44,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2024-06-27 16:50:44,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:50:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:50:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-06-27 16:50:44,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-27 16:50:44,545 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 40 transitions. [2024-06-27 16:50:44,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2024-06-27 16:50:44,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 16:50:44,548 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2024-06-27 16:50:44,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2024-06-27 16:50:44,552 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2024-06-27 16:50:44,552 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2024-06-27 16:50:44,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-06-27 16:50:44,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:44,553 INFO L208 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] [2024-06-27 16:50:44,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-06-27 16:50:44,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:44,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:50:44,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash 516960603, now seen corresponding path program 1 times [2024-06-27 16:50:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:50:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74848996] [2024-06-27 16:50:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:44,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:50:44,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:50:44,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 16:50:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:44,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:50:44,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:50:45,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:50:45,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:50:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74848996] [2024-06-27 16:50:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74848996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:50:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:50:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:50:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092545089] [2024-06-27 16:50:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:50:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:50:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:50:45,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:50:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:50:45,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:50:45,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-06-27 16:50:45,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:45,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:50:45,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:45,193 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2024-06-27 16:50:45,194 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:50:45,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 84 events. 38/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 82 conditions per place. [2024-06-27 16:50:45,195 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 25 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-27 16:50:45,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2024-06-27 16:50:45,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:50:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:50:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2024-06-27 16:50:45,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-27 16:50:45,197 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 4 states and 44 transitions. [2024-06-27 16:50:45,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2024-06-27 16:50:45,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:50:45,198 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 82 flow [2024-06-27 16:50:45,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2024-06-27 16:50:45,199 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-06-27 16:50:45,199 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 82 flow [2024-06-27 16:50:45,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-06-27 16:50:45,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:45,199 INFO L208 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] [2024-06-27 16:50:45,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-06-27 16:50:45,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:45,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:50:45,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1337774802, now seen corresponding path program 1 times [2024-06-27 16:50:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:50:45,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060826579] [2024-06-27 16:50:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:45,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:45,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:50:45,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:50:45,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-27 16:50:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:45,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:50:45,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:50:45,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:50:45,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:50:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060826579] [2024-06-27 16:50:45,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060826579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:50:45,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:50:45,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:50:45,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743101911] [2024-06-27 16:50:45,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:50:45,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:50:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:50:45,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:50:45,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:50:45,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:50:45,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06-27 16:50:45,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:45,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:50:45,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:45,824 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2024-06-27 16:50:45,825 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 16:50:45,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 85 events. 38/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 32 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 173. Up to 82 conditions per place. [2024-06-27 16:50:45,826 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 25 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2024-06-27 16:50:45,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 142 flow [2024-06-27 16:50:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:50:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:50:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-06-27 16:50:45,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-27 16:50:45,828 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 82 flow. Second operand 4 states and 45 transitions. [2024-06-27 16:50:45,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 142 flow [2024-06-27 16:50:45,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 136 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 16:50:45,829 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 94 flow [2024-06-27 16:50:45,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2024-06-27 16:50:45,830 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2024-06-27 16:50:45,830 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 94 flow [2024-06-27 16:50:45,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06-27 16:50:45,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:45,831 INFO L208 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] [2024-06-27 16:50:45,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:50:46,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:46,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:50:46,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:46,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2142678113, now seen corresponding path program 1 times [2024-06-27 16:50:46,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:50:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954737487] [2024-06-27 16:50:46,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:46,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:46,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:50:46,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:50:46,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-27 16:50:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:46,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 16:50:46,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:50:46,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:50:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:50:46,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:50:46,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954737487] [2024-06-27 16:50:46,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954737487] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:50:46,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:50:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2024-06-27 16:50:46,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181584124] [2024-06-27 16:50:46,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:50:46,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 16:50:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:50:46,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 16:50:46,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-06-27 16:50:46,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:50:46,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 94 flow. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-06-27 16:50:46,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:46,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:50:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:46,747 INFO L124 PetriNetUnfolderBase]: 74/167 cut-off events. [2024-06-27 16:50:46,748 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:50:46,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 167 events. 74/167 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 421 event pairs, 64 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 350. Up to 83 conditions per place. [2024-06-27 16:50:46,749 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 46 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2024-06-27 16:50:46,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 272 flow [2024-06-27 16:50:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:50:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:50:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-27 16:50:46,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3467741935483871 [2024-06-27 16:50:46,751 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 94 flow. Second operand 8 states and 86 transitions. [2024-06-27 16:50:46,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 272 flow [2024-06-27 16:50:46,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:50:46,753 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 146 flow [2024-06-27 16:50:46,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=146, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-27 16:50:46,754 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-27 16:50:46,754 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 146 flow [2024-06-27 16:50:46,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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-06-27 16:50:46,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:46,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:50:46,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-06-27 16:50:46,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:46,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:50:46,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1700988686, now seen corresponding path program 1 times [2024-06-27 16:50:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:50:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59938730] [2024-06-27 16:50:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:46,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:46,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:50:46,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:50:46,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-27 16:50:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:47,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 16:50:47,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:50:47,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:50:47,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:50:47,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59938730] [2024-06-27 16:50:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59938730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:50:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:50:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:50:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136803148] [2024-06-27 16:50:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:50:47,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:50:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:50:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:50:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:50:47,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:50:47,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06-27 16:50:47,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:47,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:50:47,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:47,346 INFO L124 PetriNetUnfolderBase]: 74/169 cut-off events. [2024-06-27 16:50:47,346 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-06-27 16:50:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 169 events. 74/169 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 423 event pairs, 64 based on Foata normal form. 2/165 useless extension candidates. Maximal degree in co-relation 375. Up to 164 conditions per place. [2024-06-27 16:50:47,347 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-27 16:50:47,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 218 flow [2024-06-27 16:50:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:50:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:50:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-06-27 16:50:47,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-27 16:50:47,349 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 146 flow. Second operand 4 states and 45 transitions. [2024-06-27 16:50:47,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 218 flow [2024-06-27 16:50:47,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 201 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 16:50:47,351 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 150 flow [2024-06-27 16:50:47,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-27 16:50:47,351 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-27 16:50:47,351 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 150 flow [2024-06-27 16:50:47,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-06-27 16:50:47,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:47,352 INFO L208 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] [2024-06-27 16:50:47,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-06-27 16:50:47,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:47,556 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:50:47,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash -699338097, now seen corresponding path program 1 times [2024-06-27 16:50:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:50:47,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178160451] [2024-06-27 16:50:47,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:47,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:47,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:50:47,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:50:47,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-27 16:50:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:47,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 16:50:47,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:50:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:50:47,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:50:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:50:47,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:50:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178160451] [2024-06-27 16:50:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178160451] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:50:47,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:50:47,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-06-27 16:50:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775919915] [2024-06-27 16:50:47,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:50:47,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 16:50:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:50:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 16:50:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-06-27 16:50:47,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-06-27 16:50:47,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 150 flow. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-06-27 16:50:47,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:50:47,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-06-27 16:50:47,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:50:48,317 INFO L124 PetriNetUnfolderBase]: 144/331 cut-off events. [2024-06-27 16:50:48,317 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-27 16:50:48,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 331 events. 144/331 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1176 event pairs, 128 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 737. Up to 165 conditions per place. [2024-06-27 16:50:48,319 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 52 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2024-06-27 16:50:48,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 362 flow [2024-06-27 16:50:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 16:50:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 16:50:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-27 16:50:48,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548 [2024-06-27 16:50:48,321 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 150 flow. Second operand 8 states and 84 transitions. [2024-06-27 16:50:48,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 362 flow [2024-06-27 16:50:48,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:50:48,323 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 204 flow [2024-06-27 16:50:48,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-06-27 16:50:48,324 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-27 16:50:48,324 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 204 flow [2024-06-27 16:50:48,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-06-27 16:50:48,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:50:48,324 INFO L208 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] [2024-06-27 16:50:48,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-06-27 16:50:48,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:48,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 16:50:48,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:50:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash 340607616, now seen corresponding path program 1 times [2024-06-27 16:50:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:50:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101922708] [2024-06-27 16:50:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:50:48,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 16:50:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:50:48,532 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 16:50:48,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-27 16:50:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:50:49,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:50:49,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... Killed by 15