./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:27:56,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:27:56,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:27:56,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:27:56,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:27:56,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:27:56,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:27:56,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:27:56,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:27:56,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:27:56,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:27:56,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:27:56,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:27:56,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:27:56,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:27:56,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:27:56,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:27:56,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:27:56,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:27:56,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:27:56,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:27:56,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:27:56,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:27:56,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:27:56,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:27:56,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:27:56,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:27:56,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:27:56,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:27:56,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:27:56,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:27:56,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:27:56,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:27:56,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:27:56,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:27:56,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:27:56,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:27:56,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:27:56,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:27:56,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:27:56,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:27:56,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:27:56,778 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-11-19 01:27:57,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:27:57,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:27:57,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:27:57,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:27:57,059 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:27:57,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2024-11-19 01:27:58,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:27:58,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:27:58,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-19 01:27:58,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec9c4f51/be5ee7cb475a4b63b1a7e40301bdcb96/FLAG8330e230c [2024-11-19 01:27:58,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cec9c4f51/be5ee7cb475a4b63b1a7e40301bdcb96 [2024-11-19 01:27:58,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:27:58,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:27:58,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:27:58,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:27:58,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:27:58,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:27:58" (1/1) ... [2024-11-19 01:27:58,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128ddeb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:58, skipping insertion in model container [2024-11-19 01:27:58,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:27:58" (1/1) ... [2024-11-19 01:27:58,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:27:59,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2024-11-19 01:27:59,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:27:59,127 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:27:59,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2024-11-19 01:27:59,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:27:59,226 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:27:59,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59 WrapperNode [2024-11-19 01:27:59,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:27:59,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:27:59,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:27:59,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:27:59,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,272 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-19 01:27:59,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:27:59,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:27:59,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:27:59,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:27:59,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,298 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 01:27:59,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:27:59,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:27:59,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:27:59,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:27:59,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (1/1) ... [2024-11-19 01:27:59,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:27:59,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:27:59,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:27:59,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:27:59,403 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 01:27:59,403 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 01:27:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 01:27:59,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 01:27:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:27:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:27:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:27:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:27:59,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:27:59,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:27:59,407 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:27:59,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:27:59,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:27:59,678 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:27:59,678 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:27:59,785 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:27:59,785 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 01:27:59,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:27:59 BoogieIcfgContainer [2024-11-19 01:27:59,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:27:59,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:27:59,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:27:59,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:27:59,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:27:58" (1/3) ... [2024-11-19 01:27:59,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208c733c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:27:59, skipping insertion in model container [2024-11-19 01:27:59,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:27:59" (2/3) ... [2024-11-19 01:27:59,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208c733c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:27:59, skipping insertion in model container [2024-11-19 01:27:59,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:27:59" (3/3) ... [2024-11-19 01:27:59,798 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-19 01:27:59,814 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:27:59,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:27:59,815 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:27:59,851 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:27:59,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2024-11-19 01:27:59,915 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2024-11-19 01:27:59,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:27:59,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-19 01:27:59,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2024-11-19 01:27:59,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2024-11-19 01:27:59,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:27:59,936 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51c4deb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:27:59,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 01:27:59,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:27:59,948 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2024-11-19 01:27:59,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:27:59,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:27:59,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:27:59,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:27:59,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:27:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 762204344, now seen corresponding path program 1 times [2024-11-19 01:27:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:27:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073149533] [2024-11-19 01:27:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:27:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073149533] [2024-11-19 01:28:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073149533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:00,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:00,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:28:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728152403] [2024-11-19 01:28:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:00,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:28:00,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:28:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:28:00,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:00,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:00,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:00,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:00,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:00,786 INFO L124 PetriNetUnfolderBase]: 321/543 cut-off events. [2024-11-19 01:28:00,786 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 01:28:00,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 543 events. 321/543 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2179 event pairs, 62 based on Foata normal form. 12/542 useless extension candidates. Maximal degree in co-relation 1045. Up to 221 conditions per place. [2024-11-19 01:28:00,794 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 4 changer transitions 22/54 dead transitions. [2024-11-19 01:28:00,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 54 transitions, 216 flow [2024-11-19 01:28:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:28:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:28:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2024-11-19 01:28:00,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-19 01:28:00,808 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 6 states and 84 transitions. [2024-11-19 01:28:00,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 54 transitions, 216 flow [2024-11-19 01:28:00,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:00,813 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 71 flow [2024-11-19 01:28:00,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2024-11-19 01:28:00,818 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2024-11-19 01:28:00,819 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 71 flow [2024-11-19 01:28:00,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:00,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:00,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:28:00,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:00,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1754207660, now seen corresponding path program 1 times [2024-11-19 01:28:00,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:00,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927024190] [2024-11-19 01:28:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:00,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:00,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927024190] [2024-11-19 01:28:00,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927024190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:00,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:00,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:28:00,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581884835] [2024-11-19 01:28:00,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:00,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:28:00,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:00,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:28:00,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:28:01,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:01,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-11-19 01:28:01,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:01,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:01,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:01,284 INFO L124 PetriNetUnfolderBase]: 382/689 cut-off events. [2024-11-19 01:28:01,284 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2024-11-19 01:28:01,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 689 events. 382/689 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2915 event pairs, 65 based on Foata normal form. 33/721 useless extension candidates. Maximal degree in co-relation 1572. Up to 246 conditions per place. [2024-11-19 01:28:01,294 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 46 selfloop transitions, 9 changer transitions 20/78 dead transitions. [2024-11-19 01:28:01,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 78 transitions, 379 flow [2024-11-19 01:28:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:28:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:28:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-11-19 01:28:01,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-19 01:28:01,299 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 71 flow. Second operand 9 states and 117 transitions. [2024-11-19 01:28:01,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 78 transitions, 379 flow [2024-11-19 01:28:01,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 78 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:01,304 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 156 flow [2024-11-19 01:28:01,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-11-19 01:28:01,307 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2024-11-19 01:28:01,307 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 156 flow [2024-11-19 01:28:01,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-11-19 01:28:01,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:01,308 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:01,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:28:01,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:01,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2024183696, now seen corresponding path program 2 times [2024-11-19 01:28:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:01,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123306532] [2024-11-19 01:28:01,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:28:01,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:01,328 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:28:01,328 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:01,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:01,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123306532] [2024-11-19 01:28:01,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123306532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:01,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:01,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:28:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450779687] [2024-11-19 01:28:01,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:01,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:28:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:28:01,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:28:01,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:01,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-11-19 01:28:01,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:01,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:01,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:01,685 INFO L124 PetriNetUnfolderBase]: 328/605 cut-off events. [2024-11-19 01:28:01,687 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2024-11-19 01:28:01,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 605 events. 328/605 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2538 event pairs, 65 based on Foata normal form. 57/661 useless extension candidates. Maximal degree in co-relation 1713. Up to 234 conditions per place. [2024-11-19 01:28:01,694 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 9 changer transitions 28/78 dead transitions. [2024-11-19 01:28:01,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 496 flow [2024-11-19 01:28:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:28:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:28:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-11-19 01:28:01,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-11-19 01:28:01,699 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 156 flow. Second operand 8 states and 103 transitions. [2024-11-19 01:28:01,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 496 flow [2024-11-19 01:28:01,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 78 transitions, 488 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-19 01:28:01,712 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 210 flow [2024-11-19 01:28:01,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2024-11-19 01:28:01,719 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2024-11-19 01:28:01,719 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 210 flow [2024-11-19 01:28:01,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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-11-19 01:28:01,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:01,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:01,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:28:01,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:01,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1063992253, now seen corresponding path program 1 times [2024-11-19 01:28:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:01,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297692782] [2024-11-19 01:28:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:01,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297692782] [2024-11-19 01:28:01,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297692782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:01,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:01,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:28:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891412065] [2024-11-19 01:28:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:01,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:28:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:28:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:28:01,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:01,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:01,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:01,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:01,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:02,161 INFO L124 PetriNetUnfolderBase]: 355/659 cut-off events. [2024-11-19 01:28:02,162 INFO L125 PetriNetUnfolderBase]: For 1815/1827 co-relation queries the response was YES. [2024-11-19 01:28:02,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 659 events. 355/659 cut-off events. For 1815/1827 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2860 event pairs, 80 based on Foata normal form. 21/679 useless extension candidates. Maximal degree in co-relation 2039. Up to 258 conditions per place. [2024-11-19 01:28:02,167 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 43 selfloop transitions, 16 changer transitions 21/83 dead transitions. [2024-11-19 01:28:02,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 597 flow [2024-11-19 01:28:02,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:28:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:28:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-11-19 01:28:02,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2024-11-19 01:28:02,169 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 210 flow. Second operand 9 states and 113 transitions. [2024-11-19 01:28:02,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 597 flow [2024-11-19 01:28:02,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 83 transitions, 527 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-11-19 01:28:02,177 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 297 flow [2024-11-19 01:28:02,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-11-19 01:28:02,178 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2024-11-19 01:28:02,179 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 297 flow [2024-11-19 01:28:02,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:02,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:02,179 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:02,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:28:02,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:02,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1744668785, now seen corresponding path program 2 times [2024-11-19 01:28:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:02,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255476119] [2024-11-19 01:28:02,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:28:02,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:02,194 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:28:02,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:02,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255476119] [2024-11-19 01:28:02,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255476119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:02,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:02,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:28:02,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828065376] [2024-11-19 01:28:02,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:02,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:28:02,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:02,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:28:02,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:28:02,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:02,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:02,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:02,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:02,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:02,591 INFO L124 PetriNetUnfolderBase]: 526/971 cut-off events. [2024-11-19 01:28:02,592 INFO L125 PetriNetUnfolderBase]: For 3328/3340 co-relation queries the response was YES. [2024-11-19 01:28:02,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3187 conditions, 971 events. 526/971 cut-off events. For 3328/3340 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4538 event pairs, 53 based on Foata normal form. 39/1007 useless extension candidates. Maximal degree in co-relation 3160. Up to 256 conditions per place. [2024-11-19 01:28:02,600 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 57 selfloop transitions, 22 changer transitions 23/105 dead transitions. [2024-11-19 01:28:02,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 793 flow [2024-11-19 01:28:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:28:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 01:28:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-11-19 01:28:02,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5340909090909091 [2024-11-19 01:28:02,604 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 297 flow. Second operand 11 states and 141 transitions. [2024-11-19 01:28:02,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 793 flow [2024-11-19 01:28:02,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 733 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-11-19 01:28:02,616 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 407 flow [2024-11-19 01:28:02,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=407, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-11-19 01:28:02,618 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 38 predicate places. [2024-11-19 01:28:02,619 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 407 flow [2024-11-19 01:28:02,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:02,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:02,619 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:02,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:28:02,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1091700605, now seen corresponding path program 3 times [2024-11-19 01:28:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533569638] [2024-11-19 01:28:02,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:28:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:02,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:28:02,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:02,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:02,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533569638] [2024-11-19 01:28:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533569638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:28:02,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:28:02,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:28:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933096222] [2024-11-19 01:28:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:28:02,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:28:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:02,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:28:02,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:28:02,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:02,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:02,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:02,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:02,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:03,049 INFO L124 PetriNetUnfolderBase]: 499/926 cut-off events. [2024-11-19 01:28:03,049 INFO L125 PetriNetUnfolderBase]: For 5506/5518 co-relation queries the response was YES. [2024-11-19 01:28:03,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3520 conditions, 926 events. 499/926 cut-off events. For 5506/5518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4319 event pairs, 59 based on Foata normal form. 57/980 useless extension candidates. Maximal degree in co-relation 3487. Up to 157 conditions per place. [2024-11-19 01:28:03,058 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 27 changer transitions 33/108 dead transitions. [2024-11-19 01:28:03,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 999 flow [2024-11-19 01:28:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 01:28:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 01:28:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-11-19 01:28:03,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2024-11-19 01:28:03,059 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 407 flow. Second operand 11 states and 138 transitions. [2024-11-19 01:28:03,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 999 flow [2024-11-19 01:28:03,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 931 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-19 01:28:03,071 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 514 flow [2024-11-19 01:28:03,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=514, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2024-11-19 01:28:03,071 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2024-11-19 01:28:03,072 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 514 flow [2024-11-19 01:28:03,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:03,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:03,072 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:03,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:28:03,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:03,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash 391260105, now seen corresponding path program 1 times [2024-11-19 01:28:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:03,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430888350] [2024-11-19 01:28:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:03,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430888350] [2024-11-19 01:28:03,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430888350] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:28:03,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230967287] [2024-11-19 01:28:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:03,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:03,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:28:03,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:28:03,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:28:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:03,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:28:03,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:28:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:03,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:28:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230967287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:28:03,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:28:03,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 01:28:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569853718] [2024-11-19 01:28:03,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:28:03,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:28:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:28:03,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:28:03,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:03,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 514 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:03,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:03,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:03,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:04,046 INFO L124 PetriNetUnfolderBase]: 607/1136 cut-off events. [2024-11-19 01:28:04,047 INFO L125 PetriNetUnfolderBase]: For 10981/10993 co-relation queries the response was YES. [2024-11-19 01:28:04,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4889 conditions, 1136 events. 607/1136 cut-off events. For 10981/10993 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5008 event pairs, 149 based on Foata normal form. 75/1210 useless extension candidates. Maximal degree in co-relation 4852. Up to 522 conditions per place. [2024-11-19 01:28:04,054 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 67 selfloop transitions, 19 changer transitions 67/156 dead transitions. [2024-11-19 01:28:04,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 1590 flow [2024-11-19 01:28:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 01:28:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-19 01:28:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2024-11-19 01:28:04,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2024-11-19 01:28:04,056 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 514 flow. Second operand 19 states and 231 transitions. [2024-11-19 01:28:04,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 1590 flow [2024-11-19 01:28:04,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 156 transitions, 1489 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-11-19 01:28:04,071 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 646 flow [2024-11-19 01:28:04,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=646, PETRI_PLACES=92, PETRI_TRANSITIONS=56} [2024-11-19 01:28:04,072 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2024-11-19 01:28:04,072 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 646 flow [2024-11-19 01:28:04,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:04,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:04,073 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:04,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:28:04,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:04,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash -827216793, now seen corresponding path program 2 times [2024-11-19 01:28:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:04,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829261703] [2024-11-19 01:28:04,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:28:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:04,285 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:28:04,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:04,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:04,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829261703] [2024-11-19 01:28:04,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829261703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:28:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405395202] [2024-11-19 01:28:04,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:28:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:28:04,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:28:04,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:28:04,445 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:28:04,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:04,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:28:04,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:28:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:04,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:28:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405395202] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:28:04,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:28:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 01:28:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157360828] [2024-11-19 01:28:04,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:28:04,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:28:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:04,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:28:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:28:04,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:04,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 646 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:04,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:04,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:04,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:05,331 INFO L124 PetriNetUnfolderBase]: 895/1655 cut-off events. [2024-11-19 01:28:05,331 INFO L125 PetriNetUnfolderBase]: For 37310/37322 co-relation queries the response was YES. [2024-11-19 01:28:05,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 1655 events. 895/1655 cut-off events. For 37310/37322 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8056 event pairs, 68 based on Foata normal form. 84/1738 useless extension candidates. Maximal degree in co-relation 9342. Up to 315 conditions per place. [2024-11-19 01:28:05,345 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 88 selfloop transitions, 49 changer transitions 80/220 dead transitions. [2024-11-19 01:28:05,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 220 transitions, 2852 flow [2024-11-19 01:28:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 01:28:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-19 01:28:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 334 transitions. [2024-11-19 01:28:05,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-11-19 01:28:05,348 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 646 flow. Second operand 27 states and 334 transitions. [2024-11-19 01:28:05,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 220 transitions, 2852 flow [2024-11-19 01:28:05,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 220 transitions, 2305 flow, removed 261 selfloop flow, removed 12 redundant places. [2024-11-19 01:28:05,384 INFO L231 Difference]: Finished difference. Result has 118 places, 72 transitions, 1051 flow [2024-11-19 01:28:05,384 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1051, PETRI_PLACES=118, PETRI_TRANSITIONS=72} [2024-11-19 01:28:05,385 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2024-11-19 01:28:05,385 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 72 transitions, 1051 flow [2024-11-19 01:28:05,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:05,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:05,385 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:05,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:28:05,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 01:28:05,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:05,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1859448120, now seen corresponding path program 1 times [2024-11-19 01:28:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:05,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839818700] [2024-11-19 01:28:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839818700] [2024-11-19 01:28:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839818700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:28:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231644071] [2024-11-19 01:28:05,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:28:05,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:05,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:28:05,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:28:05,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:28:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:28:05,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:28:05,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:28:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:05,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:28:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231644071] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:28:05,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:28:05,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-19 01:28:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340304127] [2024-11-19 01:28:05,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:28:05,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:28:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:05,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:28:05,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:28:06,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:06,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 72 transitions, 1051 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:06,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:06,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:06,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:06,833 INFO L124 PetriNetUnfolderBase]: 1129/2124 cut-off events. [2024-11-19 01:28:06,834 INFO L125 PetriNetUnfolderBase]: For 87490/87496 co-relation queries the response was YES. [2024-11-19 01:28:06,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14779 conditions, 2124 events. 1129/2124 cut-off events. For 87490/87496 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11104 event pairs, 153 based on Foata normal form. 69/2190 useless extension candidates. Maximal degree in co-relation 14720. Up to 490 conditions per place. [2024-11-19 01:28:06,857 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 99 selfloop transitions, 53 changer transitions 67/222 dead transitions. [2024-11-19 01:28:06,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 222 transitions, 3667 flow [2024-11-19 01:28:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 01:28:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-19 01:28:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 309 transitions. [2024-11-19 01:28:06,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-11-19 01:28:06,860 INFO L175 Difference]: Start difference. First operand has 118 places, 72 transitions, 1051 flow. Second operand 25 states and 309 transitions. [2024-11-19 01:28:06,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 222 transitions, 3667 flow [2024-11-19 01:28:06,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 222 transitions, 3084 flow, removed 275 selfloop flow, removed 13 redundant places. [2024-11-19 01:28:06,939 INFO L231 Difference]: Finished difference. Result has 136 places, 83 transitions, 1339 flow [2024-11-19 01:28:06,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1339, PETRI_PLACES=136, PETRI_TRANSITIONS=83} [2024-11-19 01:28:06,940 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 110 predicate places. [2024-11-19 01:28:06,940 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 83 transitions, 1339 flow [2024-11-19 01:28:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:06,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:06,941 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:06,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:28:07,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:07,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:07,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2089657410, now seen corresponding path program 2 times [2024-11-19 01:28:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242264285] [2024-11-19 01:28:07,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:28:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:07,155 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:28:07,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242264285] [2024-11-19 01:28:07,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242264285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:28:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511660531] [2024-11-19 01:28:07,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:28:07,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:28:07,263 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-11-19 01:28:07,265 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-11-19 01:28:07,323 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 01:28:07,323 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:07,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:28:07,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:28:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:07,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:28:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:07,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511660531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:28:07,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:28:07,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-19 01:28:07,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820724530] [2024-11-19 01:28:07,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:28:07,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 01:28:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:07,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 01:28:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:28:07,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:07,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 83 transitions, 1339 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:07,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:07,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:07,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:08,394 INFO L124 PetriNetUnfolderBase]: 1246/2377 cut-off events. [2024-11-19 01:28:08,395 INFO L125 PetriNetUnfolderBase]: For 139322/139328 co-relation queries the response was YES. [2024-11-19 01:28:08,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17840 conditions, 2377 events. 1246/2377 cut-off events. For 139322/139328 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12685 event pairs, 38 based on Foata normal form. 141/2517 useless extension candidates. Maximal degree in co-relation 17775. Up to 501 conditions per place. [2024-11-19 01:28:08,419 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 92 selfloop transitions, 80 changer transitions 102/277 dead transitions. [2024-11-19 01:28:08,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 277 transitions, 5245 flow [2024-11-19 01:28:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 01:28:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-19 01:28:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 369 transitions. [2024-11-19 01:28:08,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-11-19 01:28:08,422 INFO L175 Difference]: Start difference. First operand has 136 places, 83 transitions, 1339 flow. Second operand 30 states and 369 transitions. [2024-11-19 01:28:08,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 277 transitions, 5245 flow [2024-11-19 01:28:08,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 277 transitions, 4471 flow, removed 349 selfloop flow, removed 18 redundant places. [2024-11-19 01:28:08,558 INFO L231 Difference]: Finished difference. Result has 159 places, 104 transitions, 1972 flow [2024-11-19 01:28:08,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1972, PETRI_PLACES=159, PETRI_TRANSITIONS=104} [2024-11-19 01:28:08,558 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 133 predicate places. [2024-11-19 01:28:08,559 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 104 transitions, 1972 flow [2024-11-19 01:28:08,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:08,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:08,559 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:08,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 01:28:08,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:08,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:08,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -876448546, now seen corresponding path program 3 times [2024-11-19 01:28:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:08,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003512681] [2024-11-19 01:28:08,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:28:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:08,778 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 01:28:08,779 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:28:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003512681] [2024-11-19 01:28:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003512681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:28:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201252230] [2024-11-19 01:28:08,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:28:08,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:28:08,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:28:08,938 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-11-19 01:28:08,939 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-11-19 01:28:08,998 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 01:28:08,998 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:28:08,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 01:28:09,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:28:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:09,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:28:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:28:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201252230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:28:09,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:28:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-19 01:28:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028015201] [2024-11-19 01:28:09,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:28:09,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 01:28:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:28:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 01:28:09,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:28:09,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2024-11-19 01:28:09,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 104 transitions, 1972 flow. Second operand has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:09,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:28:09,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2024-11-19 01:28:09,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:28:10,452 INFO L124 PetriNetUnfolderBase]: 1462/2730 cut-off events. [2024-11-19 01:28:10,452 INFO L125 PetriNetUnfolderBase]: For 204367/204373 co-relation queries the response was YES. [2024-11-19 01:28:10,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22507 conditions, 2730 events. 1462/2730 cut-off events. For 204367/204373 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 14166 event pairs, 42 based on Foata normal form. 60/2789 useless extension candidates. Maximal degree in co-relation 22432. Up to 573 conditions per place. [2024-11-19 01:28:10,553 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 114 selfloop transitions, 102 changer transitions 91/310 dead transitions. [2024-11-19 01:28:10,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 310 transitions, 6366 flow [2024-11-19 01:28:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-19 01:28:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-19 01:28:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 417 transitions. [2024-11-19 01:28:10,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5110294117647058 [2024-11-19 01:28:10,557 INFO L175 Difference]: Start difference. First operand has 159 places, 104 transitions, 1972 flow. Second operand 34 states and 417 transitions. [2024-11-19 01:28:10,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 310 transitions, 6366 flow [2024-11-19 01:28:10,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 310 transitions, 5275 flow, removed 514 selfloop flow, removed 20 redundant places. [2024-11-19 01:28:10,768 INFO L231 Difference]: Finished difference. Result has 180 places, 126 transitions, 2513 flow [2024-11-19 01:28:10,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2513, PETRI_PLACES=180, PETRI_TRANSITIONS=126} [2024-11-19 01:28:10,769 INFO L277 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2024-11-19 01:28:10,769 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 126 transitions, 2513 flow [2024-11-19 01:28:10,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2631578947368425) internal successors, (138), 19 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:28:10,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:28:10,770 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:28:10,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 01:28:10,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 01:28:10,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 01:28:10,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:28:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1708128831, now seen corresponding path program 4 times [2024-11-19 01:28:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:28:10,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268585036] [2024-11-19 01:28:10,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:28:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:28:10,983 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:28:10,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 01:28:10,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:28:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:28:11,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:28:11,024 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:28:11,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-19 01:28:11,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-19 01:28:11,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 01:28:11,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:28:11,030 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1] [2024-11-19 01:28:11,113 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:28:11,113 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:28:11,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:28:11 BasicIcfg [2024-11-19 01:28:11,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:28:11,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:28:11,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:28:11,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:28:11,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:27:59" (3/4) ... [2024-11-19 01:28:11,121 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:28:11,197 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:28:11,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:28:11,198 INFO L158 Benchmark]: Toolchain (without parser) took 12457.98ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 127.5MB in the beginning and 154.1MB in the end (delta: -26.6MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2024-11-19 01:28:11,198 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:28:11,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.69ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 105.2MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 01:28:11,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.07ms. Allocated memory is still 184.5MB. Free memory was 105.2MB in the beginning and 103.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:28:11,199 INFO L158 Benchmark]: Boogie Preprocessor took 42.92ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 101.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:28:11,199 INFO L158 Benchmark]: RCFGBuilder took 469.14ms. Allocated memory is still 184.5MB. Free memory was 101.5MB in the beginning and 83.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 01:28:11,199 INFO L158 Benchmark]: TraceAbstraction took 11330.41ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 82.6MB in the beginning and 162.4MB in the end (delta: -79.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-19 01:28:11,200 INFO L158 Benchmark]: Witness Printer took 78.53ms. Allocated memory is still 293.6MB. Free memory was 162.4MB in the beginning and 154.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 01:28:11,201 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.24ms. Allocated memory is still 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.69ms. Allocated memory is still 184.5MB. Free memory was 127.5MB in the beginning and 105.2MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.07ms. Allocated memory is still 184.5MB. Free memory was 105.2MB in the beginning and 103.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.92ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 101.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.14ms. Allocated memory is still 184.5MB. Free memory was 101.5MB in the beginning and 83.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11330.41ms. Allocated memory was 184.5MB in the beginning and 293.6MB in the end (delta: 109.1MB). Free memory was 82.6MB in the beginning and 162.4MB in the end (delta: -79.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Witness Printer took 78.53ms. Allocated memory is still 293.6MB. Free memory was 162.4MB in the beginning and 154.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=7, id1=-2, id2=-1, j=6, k=0, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-2, id2=-1, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-2, id2=-1, j=16, k=4, k=4] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-2, id2=-1, j=16, k=4, k=4] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1721 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1694 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2944 IncrementalHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 10 mSDtfsCounter, 2944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2513occurred in iteration=11, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1557 SizeOfPredicates, 27 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 01:28:11,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE