./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.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/popl20-more-dec-subseq.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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:55:30,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:55:30,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:55:30,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:55:30,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:55:30,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:55:30,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:55:30,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:55:30,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:55:30,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:55:30,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:55:30,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:55:30,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:55:30,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:55:30,503 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:55:30,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:55:30,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:55:30,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:55:30,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:55:30,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:55:30,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:55:30,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:55:30,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:55:30,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:55:30,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:55:30,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:55:30,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:55:30,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:55:30,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:55:30,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:55:30,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:55:30,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:55:30,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:55:30,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:55:30,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:55:30,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:55:30,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:55:30,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:55:30,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:55:30,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:55:30,510 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:55:30,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:55:30,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:55:30,510 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2024-06-27 16:55:30,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:55:30,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:55:30,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:55:30,763 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:55:30,763 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:55:30,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 16:55:31,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:55:31,983 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:55:31,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 16:55:31,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77182c194/caab26eddc374294aba7ccf93af56ded/FLAG559a780ac [2024-06-27 16:55:32,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77182c194/caab26eddc374294aba7ccf93af56ded [2024-06-27 16:55:32,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:55:32,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:55:32,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:55:32,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:55:32,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:55:32,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2101d3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32, skipping insertion in model container [2024-06-27 16:55:32,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,033 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:55:32,231 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/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 16:55:32,237 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:55:32,247 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:55:32,266 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/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 16:55:32,268 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:55:32,282 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:55:32,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32 WrapperNode [2024-06-27 16:55:32,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:55:32,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:55:32,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:55:32,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:55:32,289 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:55:32" (1/1) ... [2024-06-27 16:55:32,294 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:55:32" (1/1) ... [2024-06-27 16:55:32,314 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 187 [2024-06-27 16:55:32,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:55:32,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:55:32,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:55:32,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:55:32,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,354 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-27 16:55:32,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:55:32,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:55:32,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:55:32,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:55:32,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (1/1) ... [2024-06-27 16:55:32,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:55:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:32,415 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:55:32,446 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:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:55:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:55:32,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:55:32,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 16:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 16:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 16:55:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:55:32,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 16:55:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 16:55:32,469 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:55:32,571 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:55:32,572 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:55:32,793 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:55:32,793 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:55:32,981 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:55:32,981 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 16:55:32,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:55:32 BoogieIcfgContainer [2024-06-27 16:55:32,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:55:32,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:55:32,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:55:32,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:55:32,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:55:32" (1/3) ... [2024-06-27 16:55:32,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d43437a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:55:32, skipping insertion in model container [2024-06-27 16:55:32,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:55:32" (2/3) ... [2024-06-27 16:55:32,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d43437a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:55:32, skipping insertion in model container [2024-06-27 16:55:32,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:55:32" (3/3) ... [2024-06-27 16:55:32,990 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-06-27 16:55:32,996 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:55:33,003 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:55:33,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:55:33,004 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:55:33,045 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:55:33,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:55:33,104 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-06-27 16:55:33,104 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:55:33,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 5/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-06-27 16:55:33,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:55:33,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 68 flow [2024-06-27 16:55:33,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:55:33,129 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;@685ca411, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:55:33,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:55:33,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:55:33,143 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2024-06-27 16:55:33,143 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:55:33,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:33,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:33,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:33,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:33,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1103126271, now seen corresponding path program 1 times [2024-06-27 16:55:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:33,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935465903] [2024-06-27 16:55:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:33,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:33,477 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:55:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935465903] [2024-06-27 16:55:33,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935465903] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:33,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:33,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016753696] [2024-06-27 16:55:33,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:33,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:55:33,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:55:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:55:33,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:33,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:55:33,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:33,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:33,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:33,648 INFO L124 PetriNetUnfolderBase]: 202/345 cut-off events. [2024-06-27 16:55:33,648 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-06-27 16:55:33,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 345 events. 202/345 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1377 event pairs, 51 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 651. Up to 188 conditions per place. [2024-06-27 16:55:33,652 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 31 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2024-06-27 16:55:33,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 163 flow [2024-06-27 16:55:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-27 16:55:33,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-27 16:55:33,663 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 68 flow. Second operand 4 states and 67 transitions. [2024-06-27 16:55:33,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 163 flow [2024-06-27 16:55:33,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 153 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:55:33,667 INFO L231 Difference]: Finished difference. Result has 30 places, 29 transitions, 74 flow [2024-06-27 16:55:33,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=74, PETRI_PLACES=30, PETRI_TRANSITIONS=29} [2024-06-27 16:55:33,671 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2024-06-27 16:55:33,671 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 29 transitions, 74 flow [2024-06-27 16:55:33,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:55:33,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:33,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:33,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:55:33,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:33,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1933867166, now seen corresponding path program 1 times [2024-06-27 16:55:33,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:33,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520463662] [2024-06-27 16:55:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:33,808 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:55:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520463662] [2024-06-27 16:55:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520463662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:33,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:33,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:33,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972813511] [2024-06-27 16:55:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:33,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:33,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:33,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:55:33,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:33,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:33,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:33,929 INFO L124 PetriNetUnfolderBase]: 202/370 cut-off events. [2024-06-27 16:55:33,929 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-06-27 16:55:33,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 370 events. 202/370 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1558 event pairs, 126 based on Foata normal form. 1/335 useless extension candidates. Maximal degree in co-relation 285. Up to 320 conditions per place. [2024-06-27 16:55:33,945 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 22 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2024-06-27 16:55:33,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2024-06-27 16:55:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-06-27 16:55:33,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-27 16:55:33,948 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 74 flow. Second operand 3 states and 48 transitions. [2024-06-27 16:55:33,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2024-06-27 16:55:33,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:55:33,951 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 82 flow [2024-06-27 16:55:33,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2024-06-27 16:55:33,953 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-27 16:55:33,954 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 82 flow [2024-06-27 16:55:33,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:55:33,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:33,955 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] [2024-06-27 16:55:33,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:55:33,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:33,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -720044749, now seen corresponding path program 1 times [2024-06-27 16:55:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:33,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182754615] [2024-06-27 16:55:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:34,177 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:55:34,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:34,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182754615] [2024-06-27 16:55:34,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182754615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:34,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:55:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425892299] [2024-06-27 16:55:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:34,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:34,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:55:34,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:34,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:34,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:34,283 INFO L124 PetriNetUnfolderBase]: 257/478 cut-off events. [2024-06-27 16:55:34,283 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-06-27 16:55:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 478 events. 257/478 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2116 event pairs, 94 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 951. Up to 216 conditions per place. [2024-06-27 16:55:34,286 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 34 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2024-06-27 16:55:34,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 194 flow [2024-06-27 16:55:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-27 16:55:34,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-06-27 16:55:34,287 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 82 flow. Second operand 3 states and 60 transitions. [2024-06-27 16:55:34,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 194 flow [2024-06-27 16:55:34,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 190 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:34,289 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 90 flow [2024-06-27 16:55:34,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2024-06-27 16:55:34,289 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2024-06-27 16:55:34,290 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 90 flow [2024-06-27 16:55:34,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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:55:34,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:34,290 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:55:34,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:55:34,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:34,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:34,291 INFO L85 PathProgramCache]: Analyzing trace with hash 859726172, now seen corresponding path program 1 times [2024-06-27 16:55:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:34,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778105945] [2024-06-27 16:55:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:34,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:34,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:34,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778105945] [2024-06-27 16:55:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778105945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:55:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367542982] [2024-06-27 16:55:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:34,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:55:34,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:34,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:55:34,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:55:34,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:34,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:55:34,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:34,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:34,454 INFO L124 PetriNetUnfolderBase]: 250/472 cut-off events. [2024-06-27 16:55:34,454 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-27 16:55:34,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 472 events. 250/472 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2061 event pairs, 102 based on Foata normal form. 11/450 useless extension candidates. Maximal degree in co-relation 1022. Up to 314 conditions per place. [2024-06-27 16:55:34,457 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2024-06-27 16:55:34,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 201 flow [2024-06-27 16:55:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:55:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:55:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-27 16:55:34,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2024-06-27 16:55:34,460 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 90 flow. Second operand 3 states and 59 transitions. [2024-06-27 16:55:34,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 201 flow [2024-06-27 16:55:34,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:34,462 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 100 flow [2024-06-27 16:55:34,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2024-06-27 16:55:34,464 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2024-06-27 16:55:34,464 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 100 flow [2024-06-27 16:55:34,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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:55:34,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:34,465 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:55:34,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:55:34,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:34,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2141843345, now seen corresponding path program 1 times [2024-06-27 16:55:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435650377] [2024-06-27 16:55:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:34,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435650377] [2024-06-27 16:55:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435650377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:55:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:55:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:55:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015771262] [2024-06-27 16:55:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:55:34,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:55:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:55:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:55:34,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:34,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:55:34,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:34,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:34,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:34,670 INFO L124 PetriNetUnfolderBase]: 307/599 cut-off events. [2024-06-27 16:55:34,671 INFO L125 PetriNetUnfolderBase]: For 73/80 co-relation queries the response was YES. [2024-06-27 16:55:34,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 599 events. 307/599 cut-off events. For 73/80 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2846 event pairs, 247 based on Foata normal form. 12/564 useless extension candidates. Maximal degree in co-relation 1079. Up to 433 conditions per place. [2024-06-27 16:55:34,673 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 25 selfloop transitions, 2 changer transitions 17/50 dead transitions. [2024-06-27 16:55:34,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 242 flow [2024-06-27 16:55:34,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2024-06-27 16:55:34,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5725806451612904 [2024-06-27 16:55:34,689 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 100 flow. Second operand 4 states and 71 transitions. [2024-06-27 16:55:34,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 242 flow [2024-06-27 16:55:34,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:55:34,691 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 112 flow [2024-06-27 16:55:34,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-06-27 16:55:34,692 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-27 16:55:34,692 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 112 flow [2024-06-27 16:55:34,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:55:34,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:34,692 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:55:34,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:55:34,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:34,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:34,693 INFO L85 PathProgramCache]: Analyzing trace with hash 812735461, now seen corresponding path program 1 times [2024-06-27 16:55:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109417757] [2024-06-27 16:55:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:35,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109417757] [2024-06-27 16:55:35,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109417757] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:35,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691482322] [2024-06-27 16:55:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:35,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:35,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:35,333 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:55:35,372 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:55:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:35,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2024-06-27 16:55:35,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:35,970 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-06-27 16:55:35,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-06-27 16:55:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:35,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:36,454 INFO L349 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2024-06-27 16:55:36,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 99 [2024-06-27 16:55:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:36,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691482322] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:36,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:55:36,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 30 [2024-06-27 16:55:36,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125156632] [2024-06-27 16:55:36,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:36,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-06-27 16:55:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:36,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-06-27 16:55:36,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-06-27 16:55:36,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:55:36,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 112 flow. Second operand has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 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:55:36,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:36,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:55:36,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:40,009 INFO L124 PetriNetUnfolderBase]: 1209/2051 cut-off events. [2024-06-27 16:55:40,010 INFO L125 PetriNetUnfolderBase]: For 347/347 co-relation queries the response was YES. [2024-06-27 16:55:40,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4846 conditions, 2051 events. 1209/2051 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9779 event pairs, 107 based on Foata normal form. 3/1791 useless extension candidates. Maximal degree in co-relation 4828. Up to 349 conditions per place. [2024-06-27 16:55:40,019 INFO L140 encePairwiseOnDemand]: 16/31 looper letters, 200 selfloop transitions, 78 changer transitions 85/366 dead transitions. [2024-06-27 16:55:40,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 366 transitions, 1772 flow [2024-06-27 16:55:40,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-06-27 16:55:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-06-27 16:55:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 602 transitions. [2024-06-27 16:55:40,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38077166350411135 [2024-06-27 16:55:40,024 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 112 flow. Second operand 51 states and 602 transitions. [2024-06-27 16:55:40,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 366 transitions, 1772 flow [2024-06-27 16:55:40,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 366 transitions, 1762 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 16:55:40,031 INFO L231 Difference]: Finished difference. Result has 117 places, 111 transitions, 751 flow [2024-06-27 16:55:40,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=751, PETRI_PLACES=117, PETRI_TRANSITIONS=111} [2024-06-27 16:55:40,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 87 predicate places. [2024-06-27 16:55:40,034 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 111 transitions, 751 flow [2024-06-27 16:55:40,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.290322580645161) internal successors, (226), 31 states have internal predecessors, (226), 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:55:40,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:40,034 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:40,065 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:55:40,248 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,SelfDestructingSolverStorable5 [2024-06-27 16:55:40,249 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:40,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash -729647344, now seen corresponding path program 2 times [2024-06-27 16:55:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384810694] [2024-06-27 16:55:40,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:55:40,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384810694] [2024-06-27 16:55:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384810694] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289135754] [2024-06-27 16:55:40,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:55:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:40,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:55:40,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 16:55:40,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:55:40,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:40,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:55:40,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:55:40,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289135754] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:40,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:55:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-06-27 16:55:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615204758] [2024-06-27 16:55:40,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:40,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 16:55:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 16:55:40,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-27 16:55:40,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:40,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 111 transitions, 751 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:55:40,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:40,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:40,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:40,731 INFO L124 PetriNetUnfolderBase]: 987/1917 cut-off events. [2024-06-27 16:55:40,731 INFO L125 PetriNetUnfolderBase]: For 10960/11071 co-relation queries the response was YES. [2024-06-27 16:55:40,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 1917 events. 987/1917 cut-off events. For 10960/11071 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9870 event pairs, 241 based on Foata normal form. 47/1882 useless extension candidates. Maximal degree in co-relation 8518. Up to 697 conditions per place. [2024-06-27 16:55:40,747 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 144 selfloop transitions, 31 changer transitions 0/186 dead transitions. [2024-06-27 16:55:40,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 186 transitions, 1663 flow [2024-06-27 16:55:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:55:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:55:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-27 16:55:40,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2024-06-27 16:55:40,748 INFO L175 Difference]: Start difference. First operand has 117 places, 111 transitions, 751 flow. Second operand 4 states and 86 transitions. [2024-06-27 16:55:40,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 186 transitions, 1663 flow [2024-06-27 16:55:40,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 186 transitions, 1403 flow, removed 121 selfloop flow, removed 15 redundant places. [2024-06-27 16:55:40,771 INFO L231 Difference]: Finished difference. Result has 95 places, 136 transitions, 897 flow [2024-06-27 16:55:40,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=897, PETRI_PLACES=95, PETRI_TRANSITIONS=136} [2024-06-27 16:55:40,771 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2024-06-27 16:55:40,772 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 136 transitions, 897 flow [2024-06-27 16:55:40,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:55:40,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:40,772 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:40,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 16:55:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-06-27 16:55:40,996 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:40,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -979768174, now seen corresponding path program 3 times [2024-06-27 16:55:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526763567] [2024-06-27 16:55:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:41,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526763567] [2024-06-27 16:55:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526763567] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257013027] [2024-06-27 16:55:41,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:55:41,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:41,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 16:55:41,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 16:55:41,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:55:41,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:41,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:55:41,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:41,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:55:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257013027] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:55:41,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:55:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-06-27 16:55:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362187359] [2024-06-27 16:55:41,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:55:41,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-27 16:55:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:55:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-27 16:55:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-06-27 16:55:41,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:55:41,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 136 transitions, 897 flow. Second operand has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 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:55:41,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:55:41,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:55:41,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:55:41,796 INFO L124 PetriNetUnfolderBase]: 861/1832 cut-off events. [2024-06-27 16:55:41,796 INFO L125 PetriNetUnfolderBase]: For 6097/6191 co-relation queries the response was YES. [2024-06-27 16:55:41,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 1832 events. 861/1832 cut-off events. For 6097/6191 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10131 event pairs, 394 based on Foata normal form. 58/1819 useless extension candidates. Maximal degree in co-relation 4373. Up to 757 conditions per place. [2024-06-27 16:55:41,808 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 57 selfloop transitions, 8 changer transitions 138/209 dead transitions. [2024-06-27 16:55:41,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 209 transitions, 1669 flow [2024-06-27 16:55:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-27 16:55:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-27 16:55:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2024-06-27 16:55:41,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532258064516129 [2024-06-27 16:55:41,810 INFO L175 Difference]: Start difference. First operand has 95 places, 136 transitions, 897 flow. Second operand 20 states and 281 transitions. [2024-06-27 16:55:41,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 209 transitions, 1669 flow [2024-06-27 16:55:41,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 209 transitions, 1631 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 16:55:41,824 INFO L231 Difference]: Finished difference. Result has 111 places, 59 transitions, 378 flow [2024-06-27 16:55:41,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=378, PETRI_PLACES=111, PETRI_TRANSITIONS=59} [2024-06-27 16:55:41,824 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-06-27 16:55:41,824 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 59 transitions, 378 flow [2024-06-27 16:55:41,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.133333333333333) internal successors, (182), 15 states have internal predecessors, (182), 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:55:41,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:55:41,825 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:55:41,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:55:42,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:42,038 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:55:42,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:55:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1294955623, now seen corresponding path program 4 times [2024-06-27 16:55:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:55:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772837997] [2024-06-27 16:55:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:55:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:55:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:55:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:55:43,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:55:43,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772837997] [2024-06-27 16:55:43,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772837997] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:55:43,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069461404] [2024-06-27 16:55:43,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:55:43,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:55:43,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:55:43,151 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:43,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 16:55:43,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:55:43,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:55:43,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 55 conjunts are in the unsatisfiable core [2024-06-27 16:55:43,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:55:43,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-06-27 16:55:43,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-06-27 16:55:43,377 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 16:55:43,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-27 16:55:43,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 16:55:43,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 16:55:44,321 INFO L349 Elim1Store]: treesize reduction 89, result has 35.5 percent of original size [2024-06-27 16:55:44,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 74 treesize of output 64 [2024-06-27 16:55:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:55:44,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:55:51,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:55:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 113 [2024-06-27 16:55:52,147 INFO L349 Elim1Store]: treesize reduction 20, result has 90.4 percent of original size [2024-06-27 16:55:52,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 337 treesize of output 420 [2024-06-27 16:55:52,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:55:52,183 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:55:52,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:55:52,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 219 treesize of output 307 [2024-06-27 16:56:20,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:20,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 118 [2024-06-27 16:56:20,646 INFO L349 Elim1Store]: treesize reduction 16, result has 92.3 percent of original size [2024-06-27 16:56:20,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 297 treesize of output 390 [2024-06-27 16:56:20,687 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:20,693 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:20,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:20,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 182 treesize of output 275 [2024-06-27 16:56:55,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:55,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 113 [2024-06-27 16:56:56,090 INFO L349 Elim1Store]: treesize reduction 12, result has 94.2 percent of original size [2024-06-27 16:56:56,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 337 treesize of output 428 [2024-06-27 16:56:56,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:56:56,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:56:56,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 219 treesize of output 315 [2024-06-27 16:58:09,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:09,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 90 [2024-06-27 16:58:09,293 INFO L349 Elim1Store]: treesize reduction 8, result has 91.4 percent of original size [2024-06-27 16:58:09,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 248 treesize of output 252 [2024-06-27 16:58:09,322 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:58:09,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:09,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 174 [2024-06-27 16:58:09,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:09,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 90 [2024-06-27 16:58:10,041 INFO L349 Elim1Store]: treesize reduction 8, result has 91.4 percent of original size [2024-06-27 16:58:10,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 248 treesize of output 252 [2024-06-27 16:58:10,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:58:10,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:10,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 174 [2024-06-27 16:58:10,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:10,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 118 [2024-06-27 16:58:10,871 INFO L349 Elim1Store]: treesize reduction 8, result has 96.1 percent of original size [2024-06-27 16:58:10,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 297 treesize of output 398 [2024-06-27 16:58:10,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-27 16:58:10,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 16:58:10,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 182 treesize of output 283 [2024-06-27 16:58:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:58:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069461404] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:58:48,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:58:48,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 52 [2024-06-27 16:58:48,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164468063] [2024-06-27 16:58:48,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:58:48,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-06-27 16:58:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:58:48,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-06-27 16:58:48,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2407, Unknown=6, NotChecked=0, Total=2756 [2024-06-27 16:58:48,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:58:48,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 59 transitions, 378 flow. Second operand has 53 states, 53 states have (on average 6.9245283018867925) internal successors, (367), 53 states have internal predecessors, (367), 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:58:48,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:58:48,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:58:48,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:02,978 INFO L124 PetriNetUnfolderBase]: 2210/3855 cut-off events. [2024-06-27 16:59:02,978 INFO L125 PetriNetUnfolderBase]: For 15486/15486 co-relation queries the response was YES. [2024-06-27 16:59:02,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15910 conditions, 3855 events. 2210/3855 cut-off events. For 15486/15486 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 20607 event pairs, 325 based on Foata normal form. 122/3758 useless extension candidates. Maximal degree in co-relation 15867. Up to 978 conditions per place. [2024-06-27 16:59:03,008 INFO L140 encePairwiseOnDemand]: 12/31 looper letters, 209 selfloop transitions, 79 changer transitions 103/394 dead transitions. [2024-06-27 16:59:03,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 394 transitions, 3156 flow [2024-06-27 16:59:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-06-27 16:59:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2024-06-27 16:59:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 633 transitions. [2024-06-27 16:59:03,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3781362007168459 [2024-06-27 16:59:03,015 INFO L175 Difference]: Start difference. First operand has 111 places, 59 transitions, 378 flow. Second operand 54 states and 633 transitions. [2024-06-27 16:59:03,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 394 transitions, 3156 flow [2024-06-27 16:59:03,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 394 transitions, 2577 flow, removed 285 selfloop flow, removed 21 redundant places. [2024-06-27 16:59:03,040 INFO L231 Difference]: Finished difference. Result has 151 places, 139 transitions, 1313 flow [2024-06-27 16:59:03,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1313, PETRI_PLACES=151, PETRI_TRANSITIONS=139} [2024-06-27 16:59:03,041 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-27 16:59:03,041 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 139 transitions, 1313 flow [2024-06-27 16:59:03,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 6.9245283018867925) internal successors, (367), 53 states have internal predecessors, (367), 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:59:03,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:03,042 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:03,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-27 16:59:03,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:03,253 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:59:03,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash -220225461, now seen corresponding path program 5 times [2024-06-27 16:59:03,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:59:03,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022492186] [2024-06-27 16:59:03,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:59:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:59:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:59:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022492186] [2024-06-27 16:59:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022492186] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:59:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596056099] [2024-06-27 16:59:04,478 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 16:59:04,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:59:04,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:04,493 INFO L229 MonitoredProcess]: Starting monitored process 6 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:59:04,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 16:59:04,602 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 16:59:04,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:04,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 53 conjunts are in the unsatisfiable core [2024-06-27 16:59:04,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:05,840 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-06-27 16:59:05,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 42 [2024-06-27 16:59:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:59:05,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:08,137 INFO L349 Elim1Store]: treesize reduction 144, result has 81.1 percent of original size [2024-06-27 16:59:08,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 199 treesize of output 669 [2024-06-27 16:59:22,117 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:59:22,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-06-27 16:59:22,127 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 16:59:22,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-27 16:59:22,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 16:59:22,340 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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.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.SimplifyDDA2.simplify(SimplifyDDA2.java:609) 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:133) 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.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.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) 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) ... 68 more [2024-06-27 16:59:22,346 INFO L158 Benchmark]: Toolchain (without parser) took 230343.42ms. Allocated memory was 174.1MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 103.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 16:59:22,346 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 16:59:22,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.03ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 143.2MB in the end (delta: -39.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-06-27 16:59:22,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.09ms. Allocated memory is still 174.1MB. Free memory was 143.2MB in the beginning and 140.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:59:22,347 INFO L158 Benchmark]: Boogie Preprocessor took 50.84ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 138.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 16:59:22,350 INFO L158 Benchmark]: RCFGBuilder took 615.91ms. Allocated memory is still 174.1MB. Free memory was 138.3MB in the beginning and 82.6MB in the end (delta: 55.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-06-27 16:59:22,351 INFO L158 Benchmark]: TraceAbstraction took 229361.51ms. Allocated memory was 174.1MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 82.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 16:59:22,352 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.16ms. Allocated memory is still 100.7MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.03ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 143.2MB in the end (delta: -39.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.09ms. Allocated memory is still 174.1MB. Free memory was 143.2MB in the beginning and 140.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.84ms. Allocated memory is still 174.1MB. Free memory was 140.7MB in the beginning and 138.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 615.91ms. Allocated memory is still 174.1MB. Free memory was 138.3MB in the beginning and 82.6MB in the end (delta: 55.7MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 229361.51ms. Allocated memory was 174.1MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 82.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. 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/popl20-more-dec-subseq.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 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:59:24,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:59:24,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 16:59:24,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:59:24,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:59:24,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:59:24,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:59:24,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:59:24,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:59:24,337 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:59:24,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:59:24,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:59:24,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:59:24,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:59:24,339 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:59:24,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:59:24,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:59:24,340 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:59:24,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:59:24,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:59:24,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:59:24,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:59:24,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:59:24,342 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 16:59:24,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 16:59:24,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:59:24,342 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 16:59:24,343 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:59:24,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:59:24,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:59:24,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:59:24,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:59:24,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:59:24,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:59:24,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:59:24,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:59:24,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:59:24,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:59:24,346 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 16:59:24,346 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 16:59:24,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:59:24,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:59:24,347 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:59:24,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:59:24,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:59:24,347 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 16:59:24,347 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2024-06-27 16:59:24,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:59:24,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:59:24,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:59:24,617 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:59:24,617 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:59:24,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 16:59:25,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:59:25,861 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:59:25,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-06-27 16:59:25,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7dcf226/07b919ce4ec54e88973caac37843ef6e/FLAG7dcb51e3c [2024-06-27 16:59:26,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7dcf226/07b919ce4ec54e88973caac37843ef6e [2024-06-27 16:59:26,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:59:26,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:59:26,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:59:26,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:59:26,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:59:26,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eff34e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26, skipping insertion in model container [2024-06-27 16:59:26,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,263 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:59:26,435 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/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 16:59:26,446 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:59:26,465 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 16:59:26,470 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:59:26,491 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/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 16:59:26,498 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:59:26,503 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:59:26,542 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/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-06-27 16:59:26,547 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:59:26,562 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:59:26,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26 WrapperNode [2024-06-27 16:59:26,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:59:26,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:59:26,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:59:26,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:59:26,571 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:59:26" (1/1) ... [2024-06-27 16:59:26,589 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:59:26" (1/1) ... [2024-06-27 16:59:26,619 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 182 [2024-06-27 16:59:26,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:59:26,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:59:26,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:59:26,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:59:26,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,664 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-27 16:59:26,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:59:26,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:59:26,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:59:26,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:59:26,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (1/1) ... [2024-06-27 16:59:26,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:59:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:59:26,721 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:59:26,728 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:59:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:59:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:59:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:59:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 16:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 16:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 16:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 16:59:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 16:59:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 16:59:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 16:59:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:59:26,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:59:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 16:59:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 16:59:26,763 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:59:26,871 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:59:26,873 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:59:27,198 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:59:27,199 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:59:27,438 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:59:27,439 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 16:59:27,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:59:27 BoogieIcfgContainer [2024-06-27 16:59:27,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:59:27,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:59:27,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:59:27,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:59:27,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:59:26" (1/3) ... [2024-06-27 16:59:27,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7324431c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:59:27, skipping insertion in model container [2024-06-27 16:59:27,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:59:26" (2/3) ... [2024-06-27 16:59:27,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7324431c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:59:27, skipping insertion in model container [2024-06-27 16:59:27,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:59:27" (3/3) ... [2024-06-27 16:59:27,446 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-06-27 16:59:27,452 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:59:27,459 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:59:27,460 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:59:27,460 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:59:27,493 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 16:59:27,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:59:27,545 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-06-27 16:59:27,545 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:59:27,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 5/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-06-27 16:59:27,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 31 transitions, 76 flow [2024-06-27 16:59:27,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 28 transitions, 68 flow [2024-06-27 16:59:27,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:59:27,569 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;@67fe4f90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:59:27,569 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 16:59:27,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:59:27,581 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2024-06-27 16:59:27,581 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 16:59:27,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:27,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:59:27,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:59:27,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1554229503, now seen corresponding path program 1 times [2024-06-27 16:59:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:27,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881934301] [2024-06-27 16:59:27,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:27,596 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:59:27,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:27,598 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:59:27,617 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:59:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:27,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-27 16:59:27,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:27,763 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:59:27,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:27,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881934301] [2024-06-27 16:59:27,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881934301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:27,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:27,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:59:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735746831] [2024-06-27 16:59:27,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:27,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:59:27,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:27,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:59:27,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:59:27,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:59:27,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:59:27,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:27,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:59:27,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:27,951 INFO L124 PetriNetUnfolderBase]: 175/325 cut-off events. [2024-06-27 16:59:27,951 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-06-27 16:59:27,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 325 events. 175/325 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1295 event pairs, 57 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 578. Up to 144 conditions per place. [2024-06-27 16:59:27,957 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 31 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-06-27 16:59:27,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 170 flow [2024-06-27 16:59:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:59:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:59:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-27 16:59:27,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-06-27 16:59:27,968 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 68 flow. Second operand 3 states and 60 transitions. [2024-06-27 16:59:27,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 170 flow [2024-06-27 16:59:27,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 16:59:27,975 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 72 flow [2024-06-27 16:59:27,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2024-06-27 16:59:27,978 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2024-06-27 16:59:27,979 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 72 flow [2024-06-27 16:59:27,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:59:27,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:27,979 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] [2024-06-27 16:59:27,989 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:59:28,182 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:59:28,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:59:28,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -850459484, now seen corresponding path program 1 times [2024-06-27 16:59:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196189507] [2024-06-27 16:59:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:28,184 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:59:28,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:28,186 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:59:28,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 16:59:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:28,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 16:59:28,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:28,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:28,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196189507] [2024-06-27 16:59:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196189507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:28,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:28,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 16:59:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341718617] [2024-06-27 16:59:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:28,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:59:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:59:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:59:28,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:59:28,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:59:28,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:28,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:59:28,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:28,534 INFO L124 PetriNetUnfolderBase]: 322/541 cut-off events. [2024-06-27 16:59:28,534 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-06-27 16:59:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 541 events. 322/541 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1878 event pairs, 92 based on Foata normal form. 13/439 useless extension candidates. Maximal degree in co-relation 718. Up to 307 conditions per place. [2024-06-27 16:59:28,538 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 42 selfloop transitions, 3 changer transitions 20/68 dead transitions. [2024-06-27 16:59:28,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 68 transitions, 286 flow [2024-06-27 16:59:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:59:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:59:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-06-27 16:59:28,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4700460829493088 [2024-06-27 16:59:28,541 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 72 flow. Second operand 7 states and 102 transitions. [2024-06-27 16:59:28,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 68 transitions, 286 flow [2024-06-27 16:59:28,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:59:28,542 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 96 flow [2024-06-27 16:59:28,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-27 16:59:28,543 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2024-06-27 16:59:28,544 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 96 flow [2024-06-27 16:59:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:59:28,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:28,544 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:59:28,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:28,747 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:59:28,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:59:28,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1396031472, now seen corresponding path program 1 times [2024-06-27 16:59:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:28,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040639308] [2024-06-27 16:59:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:28,749 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:59:28,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:28,750 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:59:28,751 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:59:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:28,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 16:59:28,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:59:28,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:28,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040639308] [2024-06-27 16:59:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040639308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:59:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677853115] [2024-06-27 16:59:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:28,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:59:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:59:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:59:28,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:59:28,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:59:28,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:28,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:59:28,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:29,010 INFO L124 PetriNetUnfolderBase]: 177/353 cut-off events. [2024-06-27 16:59:29,010 INFO L125 PetriNetUnfolderBase]: For 169/188 co-relation queries the response was YES. [2024-06-27 16:59:29,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 353 events. 177/353 cut-off events. For 169/188 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1307 event pairs, 125 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 661. Up to 277 conditions per place. [2024-06-27 16:59:29,015 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 23 selfloop transitions, 2 changer transitions 11/42 dead transitions. [2024-06-27 16:59:29,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 194 flow [2024-06-27 16:59:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:59:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:59:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-27 16:59:29,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-06-27 16:59:29,016 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 96 flow. Second operand 4 states and 67 transitions. [2024-06-27 16:59:29,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 194 flow [2024-06-27 16:59:29,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 184 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 16:59:29,020 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 100 flow [2024-06-27 16:59:29,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-06-27 16:59:29,021 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-27 16:59:29,021 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 100 flow [2024-06-27 16:59:29,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:59:29,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:29,021 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:59:29,027 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:59:29,224 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:59:29,226 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:59:29,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1038636198, now seen corresponding path program 1 times [2024-06-27 16:59:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268094539] [2024-06-27 16:59:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:29,228 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:59:29,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:29,230 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:59:29,235 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:59:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:29,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:59:29,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:29,375 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:59:29,375 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:59:29,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268094539] [2024-06-27 16:59:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268094539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:59:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:59:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:59:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013954443] [2024-06-27 16:59:29,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:59:29,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:59:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:59:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:59:29,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 16:59:29,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:59:29,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:29,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 16:59:29,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:29,486 INFO L124 PetriNetUnfolderBase]: 215/393 cut-off events. [2024-06-27 16:59:29,487 INFO L125 PetriNetUnfolderBase]: For 90/105 co-relation queries the response was YES. [2024-06-27 16:59:29,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 393 events. 215/393 cut-off events. For 90/105 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1574 event pairs, 35 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 936. Up to 284 conditions per place. [2024-06-27 16:59:29,489 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 35 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-27 16:59:29,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 220 flow [2024-06-27 16:59:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:59:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:59:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-06-27 16:59:29,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-06-27 16:59:29,493 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 100 flow. Second operand 4 states and 68 transitions. [2024-06-27 16:59:29,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 220 flow [2024-06-27 16:59:29,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 212 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 16:59:29,497 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 118 flow [2024-06-27 16:59:29,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=94, 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=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-06-27 16:59:29,498 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-27 16:59:29,498 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 118 flow [2024-06-27 16:59:29,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:59:29,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:29,498 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:59:29,504 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 (5)] Forceful destruction successful, exit code 0 [2024-06-27 16:59:29,701 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:59:29,701 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:59:29,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1682000395, now seen corresponding path program 1 times [2024-06-27 16:59:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:29,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569368766] [2024-06-27 16:59:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:59:29,702 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:59:29,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:29,705 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:59:29,708 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:59:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:59:29,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:59:29,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:29,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:29,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569368766] [2024-06-27 16:59:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569368766] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:29,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:59:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2024-06-27 16:59:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30848944] [2024-06-27 16:59:29,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:29,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 16:59:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 16:59:29,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 16:59:29,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 16:59:29,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:59:29,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:59:29,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 16:59:29,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:59:30,135 INFO L124 PetriNetUnfolderBase]: 580/974 cut-off events. [2024-06-27 16:59:30,135 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2024-06-27 16:59:30,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 974 events. 580/974 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4034 event pairs, 54 based on Foata normal form. 34/946 useless extension candidates. Maximal degree in co-relation 2363. Up to 298 conditions per place. [2024-06-27 16:59:30,139 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 59 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2024-06-27 16:59:30,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 401 flow [2024-06-27 16:59:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 16:59:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 16:59:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-27 16:59:30,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2024-06-27 16:59:30,141 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 118 flow. Second operand 7 states and 99 transitions. [2024-06-27 16:59:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 401 flow [2024-06-27 16:59:30,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 395 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:59:30,142 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 208 flow [2024-06-27 16:59:30,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-06-27 16:59:30,143 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 18 predicate places. [2024-06-27 16:59:30,143 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 208 flow [2024-06-27 16:59:30,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:59:30,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:59:30,144 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:59:30,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-06-27 16:59:30,346 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:59:30,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 16:59:30,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:59:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash -716706239, now seen corresponding path program 2 times [2024-06-27 16:59:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 16:59:30,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038977962] [2024-06-27 16:59:30,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:59:30,349 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:59:30,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 16:59:30,350 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:59:30,350 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:59:30,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:59:30,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:59:30,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:59:30,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:59:31,211 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-06-27 16:59:31,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 286 [2024-06-27 16:59:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:31,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:59:49,311 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 394 DAG size of output: 346 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 16:59:49,311 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-06-27 16:59:49,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 269 treesize of output 1571 [2024-06-27 16:59:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:59:53,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 16:59:53,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038977962] [2024-06-27 16:59:53,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038977962] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:59:53,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 16:59:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-06-27 16:59:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750242278] [2024-06-27 16:59:53,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 16:59:53,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:59:53,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 16:59:53,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:59:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-06-27 16:59:56,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:00:01,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:00:06,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:00:06,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-27 17:00:06,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 208 flow. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 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 17:00:06,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:06,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-27 17:00:06,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:08,768 INFO L124 PetriNetUnfolderBase]: 636/1110 cut-off events. [2024-06-27 17:00:08,768 INFO L125 PetriNetUnfolderBase]: For 946/952 co-relation queries the response was YES. [2024-06-27 17:00:08,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 1110 events. 636/1110 cut-off events. For 946/952 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4784 event pairs, 60 based on Foata normal form. 7/1050 useless extension candidates. Maximal degree in co-relation 3240. Up to 317 conditions per place. [2024-06-27 17:00:08,772 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 100 selfloop transitions, 11 changer transitions 4/121 dead transitions. [2024-06-27 17:00:08,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 121 transitions, 786 flow [2024-06-27 17:00:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:00:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:00:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-27 17:00:08,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2024-06-27 17:00:08,774 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 208 flow. Second operand 9 states and 132 transitions. [2024-06-27 17:00:08,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 121 transitions, 786 flow [2024-06-27 17:00:08,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 121 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:00:08,778 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 292 flow [2024-06-27 17:00:08,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-06-27 17:00:08,779 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-27 17:00:08,779 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 292 flow [2024-06-27 17:00:08,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 states have internal predecessors, (142), 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 17:00:08,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:08,780 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:08,785 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 17:00:08,985 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 17:00:08,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:00:08,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -592713162, now seen corresponding path program 3 times [2024-06-27 17:00:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622353973] [2024-06-27 17:00:08,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:00:08,989 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 17:00:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:08,990 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 17:00:08,995 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 17:00:09,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:00:09,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:09,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:09,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:00:09,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:00:10,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:00:10,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622353973] [2024-06-27 17:00:10,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622353973] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:10,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:00:10,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6] total 8 [2024-06-27 17:00:10,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681383338] [2024-06-27 17:00:10,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:10,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:00:10,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:00:10,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:00:10,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:00:10,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 17:00:10,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 292 flow. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:10,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:10,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 17:00:10,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:13,506 INFO L124 PetriNetUnfolderBase]: 3205/5278 cut-off events. [2024-06-27 17:00:13,507 INFO L125 PetriNetUnfolderBase]: For 6929/6929 co-relation queries the response was YES. [2024-06-27 17:00:13,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17627 conditions, 5278 events. 3205/5278 cut-off events. For 6929/6929 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 26076 event pairs, 182 based on Foata normal form. 185/5166 useless extension candidates. Maximal degree in co-relation 17593. Up to 933 conditions per place. [2024-06-27 17:00:13,534 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 216 selfloop transitions, 50 changer transitions 0/269 dead transitions. [2024-06-27 17:00:13,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 269 transitions, 1952 flow [2024-06-27 17:00:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:00:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:00:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 223 transitions. [2024-06-27 17:00:13,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5994623655913979 [2024-06-27 17:00:13,537 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 292 flow. Second operand 12 states and 223 transitions. [2024-06-27 17:00:13,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 269 transitions, 1952 flow [2024-06-27 17:00:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 269 transitions, 1935 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 17:00:13,559 INFO L231 Difference]: Finished difference. Result has 75 places, 111 transitions, 815 flow [2024-06-27 17:00:13,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=815, PETRI_PLACES=75, PETRI_TRANSITIONS=111} [2024-06-27 17:00:13,560 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-06-27 17:00:13,560 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 111 transitions, 815 flow [2024-06-27 17:00:13,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:13,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:13,561 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:13,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-06-27 17:00:13,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:13,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:00:13,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2076691842, now seen corresponding path program 4 times [2024-06-27 17:00:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:13,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028032804] [2024-06-27 17:00:13,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:00:13,767 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 17:00:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:13,768 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:00:13,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-27 17:00:13,872 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:00:13,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:13,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:00:13,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:00:14,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:00:14,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:00:14,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028032804] [2024-06-27 17:00:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028032804] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:14,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:00:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-27 17:00:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227203004] [2024-06-27 17:00:14,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:14,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:00:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:00:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:00:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:00:14,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-27 17:00:14,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 111 transitions, 815 flow. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:14,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:14,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-27 17:00:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:16,229 INFO L124 PetriNetUnfolderBase]: 2809/5084 cut-off events. [2024-06-27 17:00:16,229 INFO L125 PetriNetUnfolderBase]: For 14507/14690 co-relation queries the response was YES. [2024-06-27 17:00:16,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19153 conditions, 5084 events. 2809/5084 cut-off events. For 14507/14690 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 28837 event pairs, 1491 based on Foata normal form. 40/4767 useless extension candidates. Maximal degree in co-relation 16651. Up to 3930 conditions per place. [2024-06-27 17:00:16,257 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 59 selfloop transitions, 3 changer transitions 42/154 dead transitions. [2024-06-27 17:00:16,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 154 transitions, 1284 flow [2024-06-27 17:00:16,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:00:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:00:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-27 17:00:16,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-27 17:00:16,259 INFO L175 Difference]: Start difference. First operand has 75 places, 111 transitions, 815 flow. Second operand 6 states and 99 transitions. [2024-06-27 17:00:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 154 transitions, 1284 flow [2024-06-27 17:00:16,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 154 transitions, 1284 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:00:16,313 INFO L231 Difference]: Finished difference. Result has 83 places, 112 transitions, 843 flow [2024-06-27 17:00:16,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=843, PETRI_PLACES=83, PETRI_TRANSITIONS=112} [2024-06-27 17:00:16,314 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2024-06-27 17:00:16,314 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 112 transitions, 843 flow [2024-06-27 17:00:16,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:00:16,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:16,315 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:16,319 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 (9)] Ended with exit code 0 [2024-06-27 17:00:16,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:16,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:00:16,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -733667994, now seen corresponding path program 5 times [2024-06-27 17:00:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898196412] [2024-06-27 17:00:16,520 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:00:16,520 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 17:00:16,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:16,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:00:16,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-27 17:00:16,679 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-06-27 17:00:16,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:16,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 17:00:16,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:00:17,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:00:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:00:18,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:00:18,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898196412] [2024-06-27 17:00:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898196412] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:00:18,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:00:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2024-06-27 17:00:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583481670] [2024-06-27 17:00:18,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:00:18,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 17:00:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:00:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 17:00:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-06-27 17:00:18,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-06-27 17:00:18,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 112 transitions, 843 flow. Second operand has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 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 17:00:18,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:00:18,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-06-27 17:00:18,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:00:20,925 INFO L124 PetriNetUnfolderBase]: 4126/6868 cut-off events. [2024-06-27 17:00:20,925 INFO L125 PetriNetUnfolderBase]: For 21282/21282 co-relation queries the response was YES. [2024-06-27 17:00:20,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26682 conditions, 6868 events. 4126/6868 cut-off events. For 21282/21282 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36752 event pairs, 239 based on Foata normal form. 208/6727 useless extension candidates. Maximal degree in co-relation 26639. Up to 2778 conditions per place. [2024-06-27 17:00:20,965 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 245 selfloop transitions, 76 changer transitions 64/388 dead transitions. [2024-06-27 17:00:20,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 388 transitions, 3639 flow [2024-06-27 17:00:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:00:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:00:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 241 transitions. [2024-06-27 17:00:20,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43189964157706096 [2024-06-27 17:00:20,971 INFO L175 Difference]: Start difference. First operand has 83 places, 112 transitions, 843 flow. Second operand 18 states and 241 transitions. [2024-06-27 17:00:20,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 388 transitions, 3639 flow [2024-06-27 17:00:21,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 388 transitions, 3583 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-06-27 17:00:21,066 INFO L231 Difference]: Finished difference. Result has 107 places, 166 transitions, 1642 flow [2024-06-27 17:00:21,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1642, PETRI_PLACES=107, PETRI_TRANSITIONS=166} [2024-06-27 17:00:21,066 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2024-06-27 17:00:21,066 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 166 transitions, 1642 flow [2024-06-27 17:00:21,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.5) internal successors, (153), 18 states have internal predecessors, (153), 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 17:00:21,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:00:21,067 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:00:21,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-06-27 17:00:21,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:00:21,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:00:21,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:00:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash -907793129, now seen corresponding path program 6 times [2024-06-27 17:00:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:00:21,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759019031] [2024-06-27 17:00:21,274 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:00:21,274 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 17:00:21,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:00:21,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:00:21,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-06-27 17:00:21,514 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-06-27 17:00:21,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:00:21,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjunts are in the unsatisfiable core [2024-06-27 17:00:21,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:00:31,782 WARN L293 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 458 DAG size of output: 229 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:00:31,782 INFO L349 Elim1Store]: treesize reduction 1274, result has 45.4 percent of original size [2024-06-27 17:00:31,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 6 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 299 treesize of output 1122 [2024-06-27 17:00:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:00:38,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:03:31,204 WARN L293 SmtUtils]: Spent 32.94s on a formula simplification. DAG size of input: 908 DAG size of output: 604 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:03:31,205 INFO L349 Elim1Store]: treesize reduction 1137, result has 70.7 percent of original size [2024-06-27 17:03:31,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 331 treesize of output 2805 Killed by 15